./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.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.7.1.ufo.BOUNDED-14.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 3cf612fb43c98d640569a1c9328794313185fe1b6a4dbfc7e502cbb16fa8754d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:45:04,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:45:04,355 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:45:04,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:45:04,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:45:04,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:45:04,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:45:04,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:45:04,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:45:04,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:45:04,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:45:04,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:45:04,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:45:04,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:45:04,388 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:45:04,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:45:04,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:45:04,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:45:04,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:04,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:45:04,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:45:04,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:45:04,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:45:04,392 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 -> 3cf612fb43c98d640569a1c9328794313185fe1b6a4dbfc7e502cbb16fa8754d [2025-02-05 16:45:04,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:45:04,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:45:04,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:45:04,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:45:04,672 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:45:04,673 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:06,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c2ca8644/e126019456b34b4495a3500f7f0f476a/FLAGdc3ad9539 [2025-02-05 16:45:06,348 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:45:06,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:06,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c2ca8644/e126019456b34b4495a3500f7f0f476a/FLAGdc3ad9539 [2025-02-05 16:45:06,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c2ca8644/e126019456b34b4495a3500f7f0f476a [2025-02-05 16:45:06,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:45:06,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:45:06,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:06,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:45:06,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:45:06,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06, skipping insertion in model container [2025-02-05 16:45:06,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:45:06,678 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7633,7646] [2025-02-05 16:45:06,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:06,735 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:45:06,799 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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7633,7646] [2025-02-05 16:45:06,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:06,854 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:45:06,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06 WrapperNode [2025-02-05 16:45:06,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:06,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:06,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:45:06,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:45:06,863 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:45:06" (1/1) ... [2025-02-05 16:45:06,877 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:45:06" (1/1) ... [2025-02-05 16:45:06,917 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 630 [2025-02-05 16:45:06,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:06,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:45:06,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:45:06,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:45:06,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,964 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:45:06,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:45:06,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:45:06,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:45:06,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:45:06,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (1/1) ... [2025-02-05 16:45:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:07,019 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:45:07,026 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:45:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:45:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:45:07,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:45:07,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:45:07,171 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:45:07,173 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:45:07,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node7____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: havoc main_~node7__m7~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: havoc main_~node6__m6~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: havoc main_~node5__m5~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L295: havoc main_~node4__m4~0#1; [2025-02-05 16:45:07,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:45:07,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3__m3~0#1; [2025-02-05 16:45:07,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:07,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~node2__m2~0#1; [2025-02-05 16:45:07,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:45:07,859 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-05 16:45:07,859 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:45:07,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:45:07,871 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:45:07,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:07 BoogieIcfgContainer [2025-02-05 16:45:07,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:45:07,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:45:07,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:45:07,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:45:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:45:06" (1/3) ... [2025-02-05 16:45:07,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f5200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:07, skipping insertion in model container [2025-02-05 16:45:07,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:06" (2/3) ... [2025-02-05 16:45:07,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f5200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:07, skipping insertion in model container [2025-02-05 16:45:07,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:07" (3/3) ... [2025-02-05 16:45:07,884 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:07,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:45:07,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c that has 1 procedures, 136 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:45:07,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:45:07,989 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;@3c95f8ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:45:07,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:45:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:45:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:45:08,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:08,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:08,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:08,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -550288976, now seen corresponding path program 1 times [2025-02-05 16:45:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-02-05 16:45:08,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:08,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:45:08,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:45:08,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:08,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:08,476 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:45:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-02-05 16:45:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040590630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798215591] [2025-02-05 16:45:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:08,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:08,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:08,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:08,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:08,503 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 28.666666666666668) internal successors, (86), 3 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:45:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:08,572 INFO L93 Difference]: Finished difference Result 294 states and 484 transitions. [2025-02-05 16:45:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:45:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:08,583 INFO L225 Difference]: With dead ends: 294 [2025-02-05 16:45:08,584 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 16:45:08,588 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:45:08,591 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 166 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 475 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:45:08,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 475 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 16:45:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2025-02-05 16:45:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:45:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2025-02-05 16:45:08,635 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 86 [2025-02-05 16:45:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2025-02-05 16:45:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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:45:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2025-02-05 16:45:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:45:08,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:08,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:08,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:45:08,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:08,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -133436541, now seen corresponding path program 1 times [2025-02-05 16:45:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850428795] [2025-02-05 16:45:08,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:45:08,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:45:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:08,861 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:45:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850428795] [2025-02-05 16:45:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850428795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:08,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995284093] [2025-02-05 16:45:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:08,867 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:45:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:08,910 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2025-02-05 16:45:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 87 [2025-02-05 16:45:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:08,913 INFO L225 Difference]: With dead ends: 487 [2025-02-05 16:45:08,914 INFO L226 Difference]: Without dead ends: 337 [2025-02-05 16:45:08,914 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:45:08,915 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 112 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 408 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:45:08,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-05 16:45:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-02-05 16:45:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:45:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2025-02-05 16:45:08,933 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 87 [2025-02-05 16:45:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:08,933 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2025-02-05 16:45:08,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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:45:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2025-02-05 16:45:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:45:08,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:08,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:08,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:45:08,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1768129219, now seen corresponding path program 1 times [2025-02-05 16:45:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-02-05 16:45:08,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:08,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:45:08,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:45:08,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:08,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:09,097 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:45:09,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:09,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-02-05 16:45:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858507983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:09,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282365391] [2025-02-05 16:45:09,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:09,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:09,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:09,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:09,099 INFO L87 Difference]: Start difference. First operand 335 states and 502 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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:45:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:09,138 INFO L93 Difference]: Finished difference Result 867 states and 1348 transitions. [2025-02-05 16:45:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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 88 [2025-02-05 16:45:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:09,143 INFO L225 Difference]: With dead ends: 867 [2025-02-05 16:45:09,143 INFO L226 Difference]: Without dead ends: 585 [2025-02-05 16:45:09,144 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:45:09,147 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 107 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 404 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:45:09,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 404 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-05 16:45:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2025-02-05 16:45:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 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:45:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2025-02-05 16:45:09,186 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 88 [2025-02-05 16:45:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:09,186 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2025-02-05 16:45:09,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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:45:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2025-02-05 16:45:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:45:09,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:09,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:09,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:45:09,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:09,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -19676560, now seen corresponding path program 1 times [2025-02-05 16:45:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-05 16:45:09,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:45:09,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:45:09,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:09,366 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:45:09,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-05 16:45:09,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326800387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:09,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:09,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:09,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730163977] [2025-02-05 16:45:09,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:09,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:09,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:09,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:09,369 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:09,401 INFO L93 Difference]: Finished difference Result 1579 states and 2472 transitions. [2025-02-05 16:45:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:45:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:09,411 INFO L225 Difference]: With dead ends: 1579 [2025-02-05 16:45:09,413 INFO L226 Difference]: Without dead ends: 1049 [2025-02-05 16:45:09,414 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:45:09,414 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 102 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 400 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:45:09,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-05 16:45:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2025-02-05 16:45:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 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:45:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1622 transitions. [2025-02-05 16:45:09,449 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1622 transitions. Word has length 89 [2025-02-05 16:45:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1622 transitions. [2025-02-05 16:45:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1622 transitions. [2025-02-05 16:45:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:09,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:09,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:45:09,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -986734134, now seen corresponding path program 1 times [2025-02-05 16:45:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333293873] [2025-02-05 16:45:09,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:09,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:09,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333293873] [2025-02-05 16:45:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333293873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:09,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:09,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227226520] [2025-02-05 16:45:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:09,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:09,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:09,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:09,589 INFO L87 Difference]: Start difference. First operand 1047 states and 1622 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:09,632 INFO L93 Difference]: Finished difference Result 2907 states and 4552 transitions. [2025-02-05 16:45:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:09,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:45:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:09,643 INFO L225 Difference]: With dead ends: 2907 [2025-02-05 16:45:09,644 INFO L226 Difference]: Without dead ends: 1913 [2025-02-05 16:45:09,647 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:45:09,649 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 97 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 396 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:45:09,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 396 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2025-02-05 16:45:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1911. [2025-02-05 16:45:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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:45:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2966 transitions. [2025-02-05 16:45:09,720 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2966 transitions. Word has length 90 [2025-02-05 16:45:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:09,721 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 2966 transitions. [2025-02-05 16:45:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2966 transitions. [2025-02-05 16:45:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:45:09,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:09,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:09,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:45:09,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:09,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 186796637, now seen corresponding path program 1 times [2025-02-05 16:45:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719238197] [2025-02-05 16:45:09,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:09,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:45:09,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:45:09,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:09,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:09,855 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:45:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719238197] [2025-02-05 16:45:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719238197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187517275] [2025-02-05 16:45:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:09,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:09,856 INFO L87 Difference]: Start difference. First operand 1911 states and 2966 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:09,909 INFO L93 Difference]: Finished difference Result 5371 states and 8376 transitions. [2025-02-05 16:45:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:45:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:09,926 INFO L225 Difference]: With dead ends: 5371 [2025-02-05 16:45:09,927 INFO L226 Difference]: Without dead ends: 3513 [2025-02-05 16:45:09,931 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:45:09,931 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 392 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:45:09,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2025-02-05 16:45:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2025-02-05 16:45:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 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:45:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5430 transitions. [2025-02-05 16:45:10,042 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5430 transitions. Word has length 91 [2025-02-05 16:45:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:10,042 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 5430 transitions. [2025-02-05 16:45:10,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5430 transitions. [2025-02-05 16:45:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:10,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:10,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:10,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:45:10,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:10,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -791823816, now seen corresponding path program 1 times [2025-02-05 16:45:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341640567] [2025-02-05 16:45:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:10,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:10,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:10,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:10,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:10,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341640567] [2025-02-05 16:45:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341640567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291555460] [2025-02-05 16:45:10,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:10,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:10,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:10,175 INFO L87 Difference]: Start difference. First operand 3511 states and 5430 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:45:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:10,243 INFO L93 Difference]: Finished difference Result 9915 states and 15352 transitions. [2025-02-05 16:45:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:10,243 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 92 [2025-02-05 16:45:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:10,271 INFO L225 Difference]: With dead ends: 9915 [2025-02-05 16:45:10,271 INFO L226 Difference]: Without dead ends: 6457 [2025-02-05 16:45:10,277 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:45:10,279 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 87 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 388 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:45:10,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 388 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2025-02-05 16:45:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6455. [2025-02-05 16:45:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 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:45:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 9910 transitions. [2025-02-05 16:45:10,481 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 9910 transitions. Word has length 92 [2025-02-05 16:45:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 6455 states and 9910 transitions. [2025-02-05 16:45:10,482 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:45:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 9910 transitions. [2025-02-05 16:45:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:45:10,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:10,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:45:10,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1286482807, now seen corresponding path program 1 times [2025-02-05 16:45:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603385717] [2025-02-05 16:45:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:10,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:45:10,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:45:10,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:10,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:10,793 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:45:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603385717] [2025-02-05 16:45:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603385717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781086977] [2025-02-05 16:45:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:10,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:10,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:10,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:10,796 INFO L87 Difference]: Start difference. First operand 6455 states and 9910 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:11,605 INFO L93 Difference]: Finished difference Result 96083 states and 147908 transitions. [2025-02-05 16:45:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:45:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:45:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:11,954 INFO L225 Difference]: With dead ends: 96083 [2025-02-05 16:45:11,955 INFO L226 Difference]: Without dead ends: 89681 [2025-02-05 16:45:11,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:45:11,980 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 1949 mSDsluCounter, 4856 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5032 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:11,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5032 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89681 states. [2025-02-05 16:45:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89681 to 12855. [2025-02-05 16:45:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12855 states, 12854 states have (on average 1.5178154660028007) internal successors, (19510), 12854 states have internal predecessors, (19510), 0 states have call successors, (0), 0 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:45:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 19510 transitions. [2025-02-05 16:45:12,931 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 19510 transitions. Word has length 93 [2025-02-05 16:45:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:12,932 INFO L471 AbstractCegarLoop]: Abstraction has 12855 states and 19510 transitions. [2025-02-05 16:45:12,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 19510 transitions. [2025-02-05 16:45:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:12,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:12,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:45:12,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 679487282, now seen corresponding path program 1 times [2025-02-05 16:45:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596844143] [2025-02-05 16:45:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:12,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:12,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:12,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:12,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:13,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596844143] [2025-02-05 16:45:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596844143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455732535] [2025-02-05 16:45:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:13,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:13,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:13,044 INFO L87 Difference]: Start difference. First operand 12855 states and 19510 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:45:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:13,138 INFO L93 Difference]: Finished difference Result 31869 states and 48378 transitions. [2025-02-05 16:45:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:45:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:13,184 INFO L225 Difference]: With dead ends: 31869 [2025-02-05 16:45:13,184 INFO L226 Difference]: Without dead ends: 19067 [2025-02-05 16:45:13,205 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:45:13,206 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 78 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:13,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 348 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2025-02-05 16:45:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19065. [2025-02-05 16:45:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.506924045321024) internal successors, (28728), 19064 states have internal predecessors, (28728), 0 states have call successors, (0), 0 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:45:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28728 transitions. [2025-02-05 16:45:13,601 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28728 transitions. Word has length 95 [2025-02-05 16:45:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:13,601 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28728 transitions. [2025-02-05 16:45:13,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:45:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28728 transitions. [2025-02-05 16:45:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:13,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:13,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:45:13,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:13,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 680649131, now seen corresponding path program 1 times [2025-02-05 16:45:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922228759] [2025-02-05 16:45:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:13,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:13,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:14,272 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:45:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922228759] [2025-02-05 16:45:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922228759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632680539] [2025-02-05 16:45:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:14,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:14,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:14,275 INFO L87 Difference]: Start difference. First operand 19065 states and 28728 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:45:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:14,794 INFO L93 Difference]: Finished difference Result 38077 states and 57402 transitions. [2025-02-05 16:45:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:14,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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:45:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:14,841 INFO L225 Difference]: With dead ends: 38077 [2025-02-05 16:45:14,841 INFO L226 Difference]: Without dead ends: 19067 [2025-02-05 16:45:14,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:45:14,866 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 376 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:14,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 915 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:45:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2025-02-05 16:45:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19065. [2025-02-05 16:45:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.496852706672262) internal successors, (28536), 19064 states have internal predecessors, (28536), 0 states have call successors, (0), 0 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:45:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28536 transitions. [2025-02-05 16:45:15,210 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28536 transitions. Word has length 95 [2025-02-05 16:45:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28536 transitions. [2025-02-05 16:45:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:45:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28536 transitions. [2025-02-05 16:45:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:15,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:15,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:45:15,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -373758048, now seen corresponding path program 1 times [2025-02-05 16:45:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-02-05 16:45:15,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:15,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:15,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:15,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:15,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:15,391 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:45:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-02-05 16:45:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053009511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:15,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241740562] [2025-02-05 16:45:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:15,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:15,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:15,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:15,393 INFO L87 Difference]: Start difference. First operand 19065 states and 28536 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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:45:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:15,579 INFO L93 Difference]: Finished difference Result 38075 states and 57017 transitions. [2025-02-05 16:45:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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:45:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:15,611 INFO L225 Difference]: With dead ends: 38075 [2025-02-05 16:45:15,611 INFO L226 Difference]: Without dead ends: 19065 [2025-02-05 16:45:15,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:45:15,632 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 408 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:15,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 155 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:45:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19065 states. [2025-02-05 16:45:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19065 to 19065. [2025-02-05 16:45:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.4867813680234998) internal successors, (28344), 19064 states have internal predecessors, (28344), 0 states have call successors, (0), 0 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:45:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28344 transitions. [2025-02-05 16:45:15,978 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28344 transitions. Word has length 96 [2025-02-05 16:45:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28344 transitions. [2025-02-05 16:45:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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:45:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28344 transitions. [2025-02-05 16:45:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:15,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:15,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:45:15,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1416639807, now seen corresponding path program 1 times [2025-02-05 16:45:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218369774] [2025-02-05 16:45:15,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:15,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:16,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:16,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:16,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:16,395 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:45:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218369774] [2025-02-05 16:45:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218369774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:16,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:45:16,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135307998] [2025-02-05 16:45:16,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:16,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:16,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:16,396 INFO L87 Difference]: Start difference. First operand 19065 states and 28344 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:45:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:16,459 INFO L93 Difference]: Finished difference Result 19579 states and 29113 transitions. [2025-02-05 16:45:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:16,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:45:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:16,488 INFO L225 Difference]: With dead ends: 19579 [2025-02-05 16:45:16,488 INFO L226 Difference]: Without dead ends: 19577 [2025-02-05 16:45:16,496 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:45:16,496 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 692 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19577 states. [2025-02-05 16:45:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19577 to 19577. [2025-02-05 16:45:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19577 states, 19576 states have (on average 1.4707805476093174) internal successors, (28792), 19576 states have internal predecessors, (28792), 0 states have call successors, (0), 0 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:45:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19577 states to 19577 states and 28792 transitions. [2025-02-05 16:45:16,734 INFO L78 Accepts]: Start accepts. Automaton has 19577 states and 28792 transitions. Word has length 96 [2025-02-05 16:45:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 19577 states and 28792 transitions. [2025-02-05 16:45:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:45:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 19577 states and 28792 transitions. [2025-02-05 16:45:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:16,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:16,742 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:16,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:45:16,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash -125953132, now seen corresponding path program 1 times [2025-02-05 16:45:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093346038] [2025-02-05 16:45:16,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:16,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:16,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:16,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:16,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:45:16,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:16,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093346038] [2025-02-05 16:45:16,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093346038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:16,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:16,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:16,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520782606] [2025-02-05 16:45:16,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:16,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:16,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:16,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:16,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:16,998 INFO L87 Difference]: Start difference. First operand 19577 states and 28792 transitions. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:45:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:17,540 INFO L93 Difference]: Finished difference Result 153609 states and 226016 transitions. [2025-02-05 16:45:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:17,768 INFO L225 Difference]: With dead ends: 153609 [2025-02-05 16:45:17,769 INFO L226 Difference]: Without dead ends: 140295 [2025-02-05 16:45:17,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:17,818 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1571 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:17,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 2895 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140295 states. [2025-02-05 16:45:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140295 to 36025. [2025-02-05 16:45:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36025 states, 36024 states have (on average 1.4663557628247834) internal successors, (52824), 36024 states have internal predecessors, (52824), 0 states have call successors, (0), 0 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:45:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36025 states to 36025 states and 52824 transitions. [2025-02-05 16:45:19,370 INFO L78 Accepts]: Start accepts. Automaton has 36025 states and 52824 transitions. Word has length 130 [2025-02-05 16:45:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:19,370 INFO L471 AbstractCegarLoop]: Abstraction has 36025 states and 52824 transitions. [2025-02-05 16:45:19,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:45:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36025 states and 52824 transitions. [2025-02-05 16:45:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:19,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:19,381 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:45:19,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1958510796, now seen corresponding path program 1 times [2025-02-05 16:45:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245254162] [2025-02-05 16:45:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:19,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:19,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:45:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:19,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245254162] [2025-02-05 16:45:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245254162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:19,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811390201] [2025-02-05 16:45:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:19,708 INFO L87 Difference]: Start difference. First operand 36025 states and 52824 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:45:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:20,404 INFO L93 Difference]: Finished difference Result 173129 states and 254624 transitions. [2025-02-05 16:45:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:20,666 INFO L225 Difference]: With dead ends: 173129 [2025-02-05 16:45:20,667 INFO L226 Difference]: Without dead ends: 153607 [2025-02-05 16:45:20,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:20,744 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1574 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:20,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 2798 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153607 states. [2025-02-05 16:45:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153607 to 62201. [2025-02-05 16:45:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62201 states, 62200 states have (on average 1.4635369774919613) internal successors, (91032), 62200 states have internal predecessors, (91032), 0 states have call successors, (0), 0 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:45:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62201 states to 62201 states and 91032 transitions. [2025-02-05 16:45:22,392 INFO L78 Accepts]: Start accepts. Automaton has 62201 states and 91032 transitions. Word has length 130 [2025-02-05 16:45:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 62201 states and 91032 transitions. [2025-02-05 16:45:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:45:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 62201 states and 91032 transitions. [2025-02-05 16:45:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:22,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:22,405 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:22,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:45:22,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:22,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 713798356, now seen corresponding path program 1 times [2025-02-05 16:45:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667790698] [2025-02-05 16:45:22,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:22,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:22,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:22,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:22,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:45:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667790698] [2025-02-05 16:45:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667790698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104011850] [2025-02-05 16:45:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:22,713 INFO L87 Difference]: Start difference. First operand 62201 states and 91032 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:45:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:23,798 INFO L93 Difference]: Finished difference Result 192649 states and 283168 transitions. [2025-02-05 16:45:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:24,028 INFO L225 Difference]: With dead ends: 192649 [2025-02-05 16:45:24,029 INFO L226 Difference]: Without dead ends: 173127 [2025-02-05 16:45:24,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:24,061 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1603 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:24,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 2724 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173127 states. [2025-02-05 16:45:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173127 to 81721. [2025-02-05 16:45:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81721 states, 81720 states have (on average 1.463240332843857) internal successors, (119576), 81720 states have internal predecessors, (119576), 0 states have call successors, (0), 0 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:45:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81721 states to 81721 states and 119576 transitions. [2025-02-05 16:45:25,529 INFO L78 Accepts]: Start accepts. Automaton has 81721 states and 119576 transitions. Word has length 130 [2025-02-05 16:45:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 81721 states and 119576 transitions. [2025-02-05 16:45:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:45:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 81721 states and 119576 transitions. [2025-02-05 16:45:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:25,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:25,541 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:25,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:45:25,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1472285068, now seen corresponding path program 1 times [2025-02-05 16:45:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643624987] [2025-02-05 16:45:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:25,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:25,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:25,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:25,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:45:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643624987] [2025-02-05 16:45:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643624987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346647535] [2025-02-05 16:45:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:25,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:25,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:25,799 INFO L87 Difference]: Start difference. First operand 81721 states and 119576 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:45:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:26,776 INFO L93 Difference]: Finished difference Result 212169 states and 311712 transitions. [2025-02-05 16:45:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:27,004 INFO L225 Difference]: With dead ends: 212169 [2025-02-05 16:45:27,005 INFO L226 Difference]: Without dead ends: 192647 [2025-02-05 16:45:27,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:27,062 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1656 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:27,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2629 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192647 states. [2025-02-05 16:45:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192647 to 101241. [2025-02-05 16:45:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101241 states, 101240 states have (on average 1.4630580798103516) internal successors, (148120), 101240 states have internal predecessors, (148120), 0 states have call successors, (0), 0 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:45:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101241 states to 101241 states and 148120 transitions. [2025-02-05 16:45:28,884 INFO L78 Accepts]: Start accepts. Automaton has 101241 states and 148120 transitions. Word has length 130 [2025-02-05 16:45:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:28,884 INFO L471 AbstractCegarLoop]: Abstraction has 101241 states and 148120 transitions. [2025-02-05 16:45:28,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:45:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101241 states and 148120 transitions. [2025-02-05 16:45:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:28,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:28,895 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:45:28,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 172263956, now seen corresponding path program 1 times [2025-02-05 16:45:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666586823] [2025-02-05 16:45:28,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:28,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:28,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:28,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:45:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666586823] [2025-02-05 16:45:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666586823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356726619] [2025-02-05 16:45:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:29,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:29,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:29,126 INFO L87 Difference]: Start difference. First operand 101241 states and 148120 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:45:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:30,150 INFO L93 Difference]: Finished difference Result 231689 states and 340256 transitions. [2025-02-05 16:45:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:30,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:30,396 INFO L225 Difference]: With dead ends: 231689 [2025-02-05 16:45:30,396 INFO L226 Difference]: Without dead ends: 212167 [2025-02-05 16:45:30,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:30,441 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1724 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:30,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 2588 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212167 states. [2025-02-05 16:45:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212167 to 120761. [2025-02-05 16:45:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120761 states, 120760 states have (on average 1.4629347466048361) internal successors, (176664), 120760 states have internal predecessors, (176664), 0 states have call successors, (0), 0 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:45:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120761 states to 120761 states and 176664 transitions. [2025-02-05 16:45:32,710 INFO L78 Accepts]: Start accepts. Automaton has 120761 states and 176664 transitions. Word has length 130 [2025-02-05 16:45:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:32,711 INFO L471 AbstractCegarLoop]: Abstraction has 120761 states and 176664 transitions. [2025-02-05 16:45:32,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:45:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 120761 states and 176664 transitions. [2025-02-05 16:45:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:32,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:32,722 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:45:32,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1970983500, now seen corresponding path program 1 times [2025-02-05 16:45:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469619387] [2025-02-05 16:45:32,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:32,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:32,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:32,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:45:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469619387] [2025-02-05 16:45:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469619387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351791977] [2025-02-05 16:45:32,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:32,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:32,944 INFO L87 Difference]: Start difference. First operand 120761 states and 176664 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:45:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:34,166 INFO L93 Difference]: Finished difference Result 251209 states and 368800 transitions. [2025-02-05 16:45:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:34,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:34,524 INFO L225 Difference]: With dead ends: 251209 [2025-02-05 16:45:34,524 INFO L226 Difference]: Without dead ends: 231687 [2025-02-05 16:45:34,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:34,596 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1807 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:34,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2646 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231687 states. [2025-02-05 16:45:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231687 to 140281. [2025-02-05 16:45:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140281 states, 140280 states have (on average 1.462845737097234) internal successors, (205208), 140280 states have internal predecessors, (205208), 0 states have call successors, (0), 0 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:45:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140281 states to 140281 states and 205208 transitions. [2025-02-05 16:45:37,080 INFO L78 Accepts]: Start accepts. Automaton has 140281 states and 205208 transitions. Word has length 130 [2025-02-05 16:45:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:37,080 INFO L471 AbstractCegarLoop]: Abstraction has 140281 states and 205208 transitions. [2025-02-05 16:45:37,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:45:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 140281 states and 205208 transitions. [2025-02-05 16:45:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:37,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:37,092 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:37,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:45:37,092 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1763139244, now seen corresponding path program 1 times [2025-02-05 16:45:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120993289] [2025-02-05 16:45:37,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:37,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:45:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120993289] [2025-02-05 16:45:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120993289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170541] [2025-02-05 16:45:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:37,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:37,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:37,356 INFO L87 Difference]: Start difference. First operand 140281 states and 205208 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:45:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:38,658 INFO L93 Difference]: Finished difference Result 270729 states and 397344 transitions. [2025-02-05 16:45:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 130 [2025-02-05 16:45:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:39,012 INFO L225 Difference]: With dead ends: 270729 [2025-02-05 16:45:39,013 INFO L226 Difference]: Without dead ends: 251207 [2025-02-05 16:45:39,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:45:39,102 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1599 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:39,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2832 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251207 states. [2025-02-05 16:45:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251207 to 159801. [2025-02-05 16:45:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159801 states, 159800 states have (on average 1.4627784730913642) internal successors, (233752), 159800 states have internal predecessors, (233752), 0 states have call successors, (0), 0 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:45:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159801 states to 159801 states and 233752 transitions. [2025-02-05 16:45:42,036 INFO L78 Accepts]: Start accepts. Automaton has 159801 states and 233752 transitions. Word has length 130 [2025-02-05 16:45:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:42,036 INFO L471 AbstractCegarLoop]: Abstraction has 159801 states and 233752 transitions. [2025-02-05 16:45:42,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:45:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 159801 states and 233752 transitions. [2025-02-05 16:45:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:45:42,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:42,048 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:42,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:45:42,048 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:42,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2012707114, now seen corresponding path program 1 times [2025-02-05 16:45:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923667709] [2025-02-05 16:45:42,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:45:42,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:45:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:45:42,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923667709] [2025-02-05 16:45:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923667709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:45:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002606649] [2025-02-05 16:45:42,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:45:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:42,281 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:45:42,282 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:45:42,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:45:42,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:45:42,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:42,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 16:45:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:45:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:45:42,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:45:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:45:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002606649] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:45:43,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:45:43,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-02-05 16:45:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943300776] [2025-02-05 16:45:43,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:45:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:43,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:43,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:43,525 INFO L87 Difference]: Start difference. First operand 159801 states and 233752 transitions. Second operand has 9 states, 9 states have (on average 41.77777777777778) internal successors, (376), 9 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:45:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:45,251 INFO L93 Difference]: Finished difference Result 584323 states and 859325 transitions. [2025-02-05 16:45:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:45:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 41.77777777777778) internal successors, (376), 9 states have internal predecessors, (376), 0 states have call successors, (0), 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 131 [2025-02-05 16:45:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:45,925 INFO L225 Difference]: With dead ends: 584323 [2025-02-05 16:45:45,925 INFO L226 Difference]: Without dead ends: 471169 [2025-02-05 16:45:46,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:45:46,080 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 596 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:46,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1088 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:45:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471169 states. [2025-02-05 16:45:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471169 to 471161. [2025-02-05 16:45:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471161 states, 471160 states have (on average 1.4494778843704899) internal successors, (682936), 471160 states have internal predecessors, (682936), 0 states have call successors, (0), 0 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:45:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471161 states to 471161 states and 682936 transitions. [2025-02-05 16:45:53,363 INFO L78 Accepts]: Start accepts. Automaton has 471161 states and 682936 transitions. Word has length 131 [2025-02-05 16:45:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,364 INFO L471 AbstractCegarLoop]: Abstraction has 471161 states and 682936 transitions. [2025-02-05 16:45:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.77777777777778) internal successors, (376), 9 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:45:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 471161 states and 682936 transitions. [2025-02-05 16:45:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 16:45:53,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,375 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,384 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:45:53,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:45:53,576 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2082881616, now seen corresponding path program 1 times [2025-02-05 16:45:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732193744] [2025-02-05 16:45:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:53,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:45:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:45:53,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:53,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732193744] [2025-02-05 16:45:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732193744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:45:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588673369] [2025-02-05 16:45:53,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:45:53,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:53,939 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:45:53,941 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:45:54,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:45:54,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:45:54,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:45:54,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:45:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:54,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:45:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588673369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:45:55,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:45:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 16:45:55,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797061543] [2025-02-05 16:45:55,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:45:55,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:45:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:55,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:45:55,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:45:55,961 INFO L87 Difference]: Start difference. First operand 471161 states and 682936 transitions. Second operand has 26 states, 26 states have (on average 14.307692307692308) internal successors, (372), 25 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)