./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:39:55,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:39:56,006 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:39:56,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:39:56,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:39:56,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:39:56,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:39:56,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:39:56,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:39:56,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:39:56,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:39:56,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:39:56,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:39:56,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:39:56,047 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:39:56,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:39:56,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:39:56,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:56,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:39:56,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:39:56,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:39:56,050 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 -> 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 [2025-02-05 16:39:56,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:39:56,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:39:56,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:39:56,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:39:56,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:39:56,350 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:39:57,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14855c9f/ec92255d2a424f4284b229c388e73716/FLAG7b698e295 [2025-02-05 16:39:57,938 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:39:57,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:39:57,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14855c9f/ec92255d2a424f4284b229c388e73716/FLAG7b698e295 [2025-02-05 16:39:57,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c14855c9f/ec92255d2a424f4284b229c388e73716 [2025-02-05 16:39:57,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:39:57,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:39:57,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:57,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:39:57,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:39:57,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:57" (1/1) ... [2025-02-05 16:39:57,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:57, skipping insertion in model container [2025-02-05 16:39:57,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:57" (1/1) ... [2025-02-05 16:39:58,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:39:58,227 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2025-02-05 16:39:58,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:58,270 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:39:58,313 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2025-02-05 16:39:58,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:58,351 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:39:58,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58 WrapperNode [2025-02-05 16:39:58,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:58,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:58,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:39:58,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:39:58,360 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:39:58" (1/1) ... [2025-02-05 16:39:58,367 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:39:58" (1/1) ... [2025-02-05 16:39:58,392 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 370 [2025-02-05 16:39:58,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:58,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:39:58,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:39:58,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:39:58,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,420 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:39:58,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:39:58,433 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:39:58,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:39:58,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:39:58,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (1/1) ... [2025-02-05 16:39:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:58,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:58,472 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:39:58,478 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:39:58,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:39:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:39:58,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:39:58,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:39:58,603 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:39:58,606 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node4__m4~0#1; [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node3__m3~0#1; [2025-02-05 16:39:58,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1; [2025-02-05 16:39:58,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:39:58,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:39:58,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:39:58,989 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-05 16:39:58,990 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:39:59,004 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:39:59,006 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:39:59,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:59 BoogieIcfgContainer [2025-02-05 16:39:59,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:39:59,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:39:59,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:39:59,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:39:59,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:39:57" (1/3) ... [2025-02-05 16:39:59,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:59, skipping insertion in model container [2025-02-05 16:39:59,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:58" (2/3) ... [2025-02-05 16:39:59,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:59, skipping insertion in model container [2025-02-05 16:39:59,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:59" (3/3) ... [2025-02-05 16:39:59,016 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:39:59,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:39:59,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 81 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:39:59,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:39:59,100 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;@13d1b7bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:39:59,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:39:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:39:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 16:39:59,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:59,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:59,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1902463410, now seen corresponding path program 1 times [2025-02-05 16:39:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-02-05 16:39:59,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 16:39:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 16:39:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,531 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:39:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441272977] [2025-02-05 16:39:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441272977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448910427] [2025-02-05 16:39:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:59,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:59,565 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,626 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2025-02-05 16:39:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 16:39:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,636 INFO L225 Difference]: With dead ends: 183 [2025-02-05 16:39:59,636 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 16:39:59,639 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:39:59,641 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 273 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:39:59,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 16:39:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-02-05 16:39:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2025-02-05 16:39:59,674 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 48 [2025-02-05 16:39:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:59,675 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2025-02-05 16:39:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2025-02-05 16:39:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:39:59,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:59,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:39:59,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:59,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1863960088, now seen corresponding path program 1 times [2025-02-05 16:39:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954606034] [2025-02-05 16:39:59,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:39:59,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:39:59,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,846 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:39:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954606034] [2025-02-05 16:39:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954606034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424629805] [2025-02-05 16:39:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:59,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:59,851 INFO L87 Difference]: Start difference. First operand 120 states and 175 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,885 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2025-02-05 16:39:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-05 16:39:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,887 INFO L225 Difference]: With dead ends: 292 [2025-02-05 16:39:59,887 INFO L226 Difference]: Without dead ends: 198 [2025-02-05 16:39:59,888 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:39:59,889 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 231 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:39:59,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-05 16:39:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2025-02-05 16:39:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:39:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 295 transitions. [2025-02-05 16:39:59,904 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 295 transitions. Word has length 49 [2025-02-05 16:39:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:59,904 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 295 transitions. [2025-02-05 16:39:59,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 295 transitions. [2025-02-05 16:39:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 16:39:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:39:59,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:59,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1169511749, now seen corresponding path program 1 times [2025-02-05 16:39:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-02-05 16:39:59,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 16:39:59,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 16:39:59,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:00,062 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:40:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-02-05 16:40:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672514256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089991735] [2025-02-05 16:40:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:00,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:00,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:00,067 INFO L87 Difference]: Start difference. First operand 196 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:00,097 INFO L93 Difference]: Finished difference Result 504 states and 781 transitions. [2025-02-05 16:40:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-05 16:40:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:00,100 INFO L225 Difference]: With dead ends: 504 [2025-02-05 16:40:00,103 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 16:40:00,104 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:40:00,105 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 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:40:00,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 16:40:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2025-02-05 16:40:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:40:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2025-02-05 16:40:00,134 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 50 [2025-02-05 16:40:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:00,135 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2025-02-05 16:40:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2025-02-05 16:40:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:40:00,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:00,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:00,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:40:00,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:00,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -109906907, now seen corresponding path program 1 times [2025-02-05 16:40:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-05 16:40:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:40:00,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:40:00,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:00,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:00,368 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:40:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-05 16:40:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210561572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:00,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:00,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083566849] [2025-02-05 16:40:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:00,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:00,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:00,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:00,369 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:00,594 INFO L93 Difference]: Finished difference Result 2780 states and 4355 transitions. [2025-02-05 16:40:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-05 16:40:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:00,606 INFO L225 Difference]: With dead ends: 2780 [2025-02-05 16:40:00,606 INFO L226 Difference]: Without dead ends: 2474 [2025-02-05 16:40:00,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:40:00,608 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 703 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:00,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1199 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2025-02-05 16:40:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 636. [2025-02-05 16:40:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 0 states have call successors, (0), 0 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:40:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 971 transitions. [2025-02-05 16:40:00,655 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 971 transitions. Word has length 51 [2025-02-05 16:40:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:00,656 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 971 transitions. [2025-02-05 16:40:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 971 transitions. [2025-02-05 16:40:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:40:00,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:00,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:00,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:40:00,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:00,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1792526254, now seen corresponding path program 1 times [2025-02-05 16:40:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-02-05 16:40:00,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:00,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:40:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:40:00,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:00,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:00,801 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:40:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-02-05 16:40:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268270914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:00,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399915263] [2025-02-05 16:40:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:00,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:00,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:00,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:00,804 INFO L87 Difference]: Start difference. First operand 636 states and 971 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:00,838 INFO L93 Difference]: Finished difference Result 1768 states and 2709 transitions. [2025-02-05 16:40:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:00,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-05 16:40:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:00,845 INFO L225 Difference]: With dead ends: 1768 [2025-02-05 16:40:00,845 INFO L226 Difference]: Without dead ends: 1158 [2025-02-05 16:40:00,846 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:40:00,849 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:00,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-05 16:40:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1140. [2025-02-05 16:40:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.498683055311677) internal successors, (1707), 1139 states have internal predecessors, (1707), 0 states have call successors, (0), 0 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:40:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1707 transitions. [2025-02-05 16:40:00,886 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1707 transitions. Word has length 53 [2025-02-05 16:40:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1707 transitions. [2025-02-05 16:40:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1707 transitions. [2025-02-05 16:40:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:40:00,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:00,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:00,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:40:00,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1793688103, now seen corresponding path program 1 times [2025-02-05 16:40:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:00,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314853373] [2025-02-05 16:40:00,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:40:00,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:40:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:00,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,218 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:40:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314853373] [2025-02-05 16:40:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314853373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298231] [2025-02-05 16:40:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:01,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:01,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:01,219 INFO L87 Difference]: Start difference. First operand 1140 states and 1707 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:01,354 INFO L93 Difference]: Finished difference Result 2256 states and 3389 transitions. [2025-02-05 16:40:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:01,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-05 16:40:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:01,360 INFO L225 Difference]: With dead ends: 2256 [2025-02-05 16:40:01,361 INFO L226 Difference]: Without dead ends: 1142 [2025-02-05 16:40:01,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:01,362 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 220 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:01,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-02-05 16:40:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2025-02-05 16:40:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 0 states have call successors, (0), 0 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:40:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1691 transitions. [2025-02-05 16:40:01,392 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1691 transitions. Word has length 53 [2025-02-05 16:40:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1691 transitions. [2025-02-05 16:40:01,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1691 transitions. [2025-02-05 16:40:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:40:01,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:01,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:01,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:40:01,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:01,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -229288349, now seen corresponding path program 1 times [2025-02-05 16:40:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856478288] [2025-02-05 16:40:01,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:01,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:40:01,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:40:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,695 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:40:01,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:01,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856478288] [2025-02-05 16:40:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856478288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:40:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846804341] [2025-02-05 16:40:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:01,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:01,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:01,697 INFO L87 Difference]: Start difference. First operand 1140 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:01,726 INFO L93 Difference]: Finished difference Result 1174 states and 1740 transitions. [2025-02-05 16:40:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:40:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:01,731 INFO L225 Difference]: With dead ends: 1174 [2025-02-05 16:40:01,731 INFO L226 Difference]: Without dead ends: 1172 [2025-02-05 16:40:01,731 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:40:01,732 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:01,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-05 16:40:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2025-02-05 16:40:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.4645602049530315) internal successors, (1715), 1171 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:40:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1715 transitions. [2025-02-05 16:40:01,759 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1715 transitions. Word has length 54 [2025-02-05 16:40:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:01,760 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1715 transitions. [2025-02-05 16:40:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1715 transitions. [2025-02-05 16:40:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:40:01,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:01,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:01,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:40:01,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:01,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1737098488, now seen corresponding path program 1 times [2025-02-05 16:40:01,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:01,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-02-05 16:40:01,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:40:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:40:01,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-02-05 16:40:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:01,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-02-05 16:40:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:01,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:01,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:01,838 INFO L87 Difference]: Start difference. First operand 1172 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:01,862 INFO L93 Difference]: Finished difference Result 2299 states and 3401 transitions. [2025-02-05 16:40:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:40:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:01,868 INFO L225 Difference]: With dead ends: 2299 [2025-02-05 16:40:01,868 INFO L226 Difference]: Without dead ends: 1656 [2025-02-05 16:40:01,869 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:40:01,870 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 69 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 243 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:40:01,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 243 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-02-05 16:40:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1654. [2025-02-05 16:40:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4597701149425288) internal successors, (2413), 1653 states have internal predecessors, (2413), 0 states have call successors, (0), 0 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:40:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2413 transitions. [2025-02-05 16:40:01,921 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2413 transitions. Word has length 54 [2025-02-05 16:40:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:01,921 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2413 transitions. [2025-02-05 16:40:01,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2413 transitions. [2025-02-05 16:40:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:40:01,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:01,923 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] [2025-02-05 16:40:01,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:40:01,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:01,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 540135094, now seen corresponding path program 1 times [2025-02-05 16:40:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:01,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-02-05 16:40:01,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:40:01,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:40:01,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:40:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-02-05 16:40:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446556976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410533662] [2025-02-05 16:40:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:02,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:02,065 INFO L87 Difference]: Start difference. First operand 1654 states and 2413 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:40:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,188 INFO L93 Difference]: Finished difference Result 8472 states and 12394 transitions. [2025-02-05 16:40:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:40:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,215 INFO L225 Difference]: With dead ends: 8472 [2025-02-05 16:40:02,215 INFO L226 Difference]: Without dead ends: 6846 [2025-02-05 16:40:02,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:02,220 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 519 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:02,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 590 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6846 states. [2025-02-05 16:40:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6846 to 3278. [2025-02-05 16:40:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3277 states have (on average 1.456515105279219) internal successors, (4773), 3277 states have internal predecessors, (4773), 0 states have call successors, (0), 0 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:40:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4773 transitions. [2025-02-05 16:40:02,314 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4773 transitions. Word has length 77 [2025-02-05 16:40:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 4773 transitions. [2025-02-05 16:40:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:40:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4773 transitions. [2025-02-05 16:40:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:40:02,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,316 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] [2025-02-05 16:40:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:40:02,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1395268106, now seen corresponding path program 1 times [2025-02-05 16:40:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-02-05 16:40:02,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:40:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:40:02,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:40:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-02-05 16:40:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057364441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-02-05 16:40:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:02,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:02,461 INFO L87 Difference]: Start difference. First operand 3278 states and 4773 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,591 INFO L93 Difference]: Finished difference Result 10096 states and 14754 transitions. [2025-02-05 16:40:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:40:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,623 INFO L225 Difference]: With dead ends: 10096 [2025-02-05 16:40:02,623 INFO L226 Difference]: Without dead ends: 8470 [2025-02-05 16:40:02,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:02,629 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 500 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:02,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 587 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2025-02-05 16:40:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 5718. [2025-02-05 16:40:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.45058597166346) internal successors, (8293), 5717 states have internal predecessors, (8293), 0 states have call successors, (0), 0 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:40:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8293 transitions. [2025-02-05 16:40:02,819 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8293 transitions. Word has length 77 [2025-02-05 16:40:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,820 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8293 transitions. [2025-02-05 16:40:02,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8293 transitions. [2025-02-05 16:40:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:40:02,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,826 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] [2025-02-05 16:40:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:40:02,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1603112362, now seen corresponding path program 1 times [2025-02-05 16:40:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-02-05 16:40:02,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:40:02,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:40:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:40:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-02-05 16:40:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290510508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797517885] [2025-02-05 16:40:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:02,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:02,998 INFO L87 Difference]: Start difference. First operand 5718 states and 8293 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:40:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:03,128 INFO L93 Difference]: Finished difference Result 11720 states and 17114 transitions. [2025-02-05 16:40:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:40:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:03,168 INFO L225 Difference]: With dead ends: 11720 [2025-02-05 16:40:03,168 INFO L226 Difference]: Without dead ends: 10094 [2025-02-05 16:40:03,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:03,175 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 465 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:03,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 633 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2025-02-05 16:40:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 7342. [2025-02-05 16:40:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7342 states, 7341 states have (on average 1.4511646914589293) internal successors, (10653), 7341 states have internal predecessors, (10653), 0 states have call successors, (0), 0 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:40:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 10653 transitions. [2025-02-05 16:40:03,407 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 10653 transitions. Word has length 77 [2025-02-05 16:40:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:03,407 INFO L471 AbstractCegarLoop]: Abstraction has 7342 states and 10653 transitions. [2025-02-05 16:40:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:40:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 10653 transitions. [2025-02-05 16:40:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:40:03,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:03,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:03,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:40:03,410 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:03,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -941112209, now seen corresponding path program 1 times [2025-02-05 16:40:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:03,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-02-05 16:40:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:03,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:40:03,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:40:03,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:03,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:40:03,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268515409] [2025-02-05 16:40:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268515409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008650586] [2025-02-05 16:40:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:03,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:03,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:03,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:03,539 INFO L87 Difference]: Start difference. First operand 7342 states and 10653 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:03,690 INFO L93 Difference]: Finished difference Result 12336 states and 18034 transitions. [2025-02-05 16:40:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:03,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:40:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:03,718 INFO L225 Difference]: With dead ends: 12336 [2025-02-05 16:40:03,718 INFO L226 Difference]: Without dead ends: 11214 [2025-02-05 16:40:03,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:03,724 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 506 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:03,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 679 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2025-02-05 16:40:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 8462. [2025-02-05 16:40:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8462 states, 8461 states have (on average 1.4538470629949178) internal successors, (12301), 8461 states have internal predecessors, (12301), 0 states have call successors, (0), 0 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:40:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 12301 transitions. [2025-02-05 16:40:03,940 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 12301 transitions. Word has length 78 [2025-02-05 16:40:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:03,940 INFO L471 AbstractCegarLoop]: Abstraction has 8462 states and 12301 transitions. [2025-02-05 16:40:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 12301 transitions. [2025-02-05 16:40:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:40:03,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:03,943 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] [2025-02-05 16:40:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:40:03,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:03,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1856058126, now seen corresponding path program 1 times [2025-02-05 16:40:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-02-05 16:40:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:03,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:40:03,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:40:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-02-05 16:40:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190306099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:04,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323863] [2025-02-05 16:40:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:04,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:04,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:04,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:04,064 INFO L87 Difference]: Start difference. First operand 8462 states and 12301 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:04,108 INFO L93 Difference]: Finished difference Result 14658 states and 21408 transitions. [2025-02-05 16:40:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:40:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:04,124 INFO L225 Difference]: With dead ends: 14658 [2025-02-05 16:40:04,124 INFO L226 Difference]: Without dead ends: 6224 [2025-02-05 16:40:04,134 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:40:04,135 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:04,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 232 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2025-02-05 16:40:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6222. [2025-02-05 16:40:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 1.4539463108824948) internal successors, (9045), 6221 states have internal predecessors, (9045), 0 states have call successors, (0), 0 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:40:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 9045 transitions. [2025-02-05 16:40:04,265 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 9045 transitions. Word has length 79 [2025-02-05 16:40:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:04,265 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 9045 transitions. [2025-02-05 16:40:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 9045 transitions. [2025-02-05 16:40:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:40:04,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:04,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:40:04,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:04,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1299196494, now seen corresponding path program 1 times [2025-02-05 16:40:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-02-05 16:40:04,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:04,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:40:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:40:04,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-02-05 16:40:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003128665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122397617] [2025-02-05 16:40:04,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:04,885 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:40:04,887 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:40:04,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:40:05,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:40:05,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:40:05,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:05,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122397617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:06,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-02-05 16:40:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862964142] [2025-02-05 16:40:06,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:40:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:06,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:40:06,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:40:06,798 INFO L87 Difference]: Start difference. First operand 6222 states and 9045 transitions. Second operand has 30 states, 30 states have (on average 6.633333333333334) internal successors, (199), 29 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:10,797 INFO L93 Difference]: Finished difference Result 68235 states and 98250 transitions. [2025-02-05 16:40:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-02-05 16:40:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.633333333333334) internal successors, (199), 29 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:40:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:10,931 INFO L225 Difference]: With dead ends: 68235 [2025-02-05 16:40:10,931 INFO L226 Difference]: Without dead ends: 62043 [2025-02-05 16:40:10,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5562 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2618, Invalid=13384, Unknown=0, NotChecked=0, Total=16002 [2025-02-05 16:40:10,956 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 3876 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3876 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:10,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3876 Valid, 1289 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:40:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62043 states. [2025-02-05 16:40:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62043 to 30869. [2025-02-05 16:40:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30869 states, 30868 states have (on average 1.4322599455747052) internal successors, (44211), 30868 states have internal predecessors, (44211), 0 states have call successors, (0), 0 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:40:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30869 states to 30869 states and 44211 transitions. [2025-02-05 16:40:11,664 INFO L78 Accepts]: Start accepts. Automaton has 30869 states and 44211 transitions. Word has length 79 [2025-02-05 16:40:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:11,664 INFO L471 AbstractCegarLoop]: Abstraction has 30869 states and 44211 transitions. [2025-02-05 16:40:11,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.633333333333334) internal successors, (199), 29 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30869 states and 44211 transitions. [2025-02-05 16:40:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:40:11,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:11,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:11,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:40:11,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 16:40:11,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:11,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1765138133, now seen corresponding path program 1 times [2025-02-05 16:40:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-05 16:40:11,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:11,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:40:11,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:40:11,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:11,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-05 16:40:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671499279] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582670899] [2025-02-05 16:40:12,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:12,280 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:40:12,282 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:40:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:40:12,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:40:12,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:12,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:12,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:40:12,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:13,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582670899] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:13,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-05 16:40:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117540356] [2025-02-05 16:40:13,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:13,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:40:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:13,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:40:13,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:40:13,937 INFO L87 Difference]: Start difference. First operand 30869 states and 44211 transitions. Second operand has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 28 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:40:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:18,942 INFO L93 Difference]: Finished difference Result 321911 states and 458042 transitions. [2025-02-05 16:40:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-02-05 16:40:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 28 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:40:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,473 INFO L225 Difference]: With dead ends: 321911 [2025-02-05 16:40:19,473 INFO L226 Difference]: Without dead ends: 291083 [2025-02-05 16:40:19,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7264 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3732, Invalid=18024, Unknown=0, NotChecked=0, Total=21756 [2025-02-05 16:40:19,529 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 4459 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4459 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4459 Valid, 865 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:40:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291083 states. [2025-02-05 16:40:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291083 to 181133. [2025-02-05 16:40:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181133 states, 181132 states have (on average 1.403446105602544) internal successors, (254209), 181132 states have internal predecessors, (254209), 0 states have call successors, (0), 0 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:40:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181133 states to 181133 states and 254209 transitions. [2025-02-05 16:40:22,776 INFO L78 Accepts]: Start accepts. Automaton has 181133 states and 254209 transitions. Word has length 80 [2025-02-05 16:40:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,776 INFO L471 AbstractCegarLoop]: Abstraction has 181133 states and 254209 transitions. [2025-02-05 16:40:22,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.827586206896552) internal successors, (227), 28 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:40:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 181133 states and 254209 transitions. [2025-02-05 16:40:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:40:22,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,790 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] [2025-02-05 16:40:22,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:40:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 16:40:22,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1072934578, now seen corresponding path program 1 times [2025-02-05 16:40:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-02-05 16:40:22,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:40:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:40:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:40:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-02-05 16:40:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184514898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60779270] [2025-02-05 16:40:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:23,051 INFO L87 Difference]: Start difference. First operand 181133 states and 254209 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,294 INFO L93 Difference]: Finished difference Result 339239 states and 476258 transitions. [2025-02-05 16:40:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:40:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,523 INFO L225 Difference]: With dead ends: 339239 [2025-02-05 16:40:24,523 INFO L226 Difference]: Without dead ends: 158301 [2025-02-05 16:40:24,578 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:40:24,579 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 61 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:24,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 99 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158301 states. [2025-02-05 16:40:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158301 to 158301. [2025-02-05 16:40:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158301 states, 158300 states have (on average 1.3893935565382185) internal successors, (219941), 158300 states have internal predecessors, (219941), 0 states have call successors, (0), 0 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:40:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158301 states to 158301 states and 219941 transitions. [2025-02-05 16:40:26,734 INFO L78 Accepts]: Start accepts. Automaton has 158301 states and 219941 transitions. Word has length 82 [2025-02-05 16:40:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:26,735 INFO L471 AbstractCegarLoop]: Abstraction has 158301 states and 219941 transitions. [2025-02-05 16:40:26,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158301 states and 219941 transitions. [2025-02-05 16:40:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:40:26,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:26,739 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] [2025-02-05 16:40:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:40:26,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash -58443464, now seen corresponding path program 1 times [2025-02-05 16:40:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296496848] [2025-02-05 16:40:26,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:40:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:40:26,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:26,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296496848] [2025-02-05 16:40:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296496848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934585380] [2025-02-05 16:40:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:26,828 INFO L87 Difference]: Start difference. First operand 158301 states and 219941 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:27,749 INFO L93 Difference]: Finished difference Result 245565 states and 341335 transitions. [2025-02-05 16:40:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:40:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:27,891 INFO L225 Difference]: With dead ends: 245565 [2025-02-05 16:40:27,892 INFO L226 Difference]: Without dead ends: 87459 [2025-02-05 16:40:27,942 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:40:27,943 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 41 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:27,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87459 states. [2025-02-05 16:40:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87459 to 87457. [2025-02-05 16:40:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87457 states, 87456 states have (on average 1.3701861507500914) internal successors, (119831), 87456 states have internal predecessors, (119831), 0 states have call successors, (0), 0 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:40:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87457 states to 87457 states and 119831 transitions. [2025-02-05 16:40:29,060 INFO L78 Accepts]: Start accepts. Automaton has 87457 states and 119831 transitions. Word has length 82 [2025-02-05 16:40:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:29,060 INFO L471 AbstractCegarLoop]: Abstraction has 87457 states and 119831 transitions. [2025-02-05 16:40:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 87457 states and 119831 transitions. [2025-02-05 16:40:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:40:29,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:29,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:29,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:40:29,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash -521915763, now seen corresponding path program 1 times [2025-02-05 16:40:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-02-05 16:40:29,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:29,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:40:29,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:40:29,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:29,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877055067] [2025-02-05 16:40:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877055067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909848908] [2025-02-05 16:40:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:29,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:29,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:40:29,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:40:30,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:40:30,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:40:30,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:30,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:30,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 16:40:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:34,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909848908] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:36,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 24] total 54 [2025-02-05 16:40:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435457247] [2025-02-05 16:40:36,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 16:40:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:36,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 16:40:36,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2480, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 16:40:36,086 INFO L87 Difference]: Start difference. First operand 87457 states and 119831 transitions. Second operand has 54 states, 54 states have (on average 4.092592592592593) internal successors, (221), 54 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:41:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:05,391 INFO L93 Difference]: Finished difference Result 317503 states and 434278 transitions. [2025-02-05 16:41:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2025-02-05 16:41:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.092592592592593) internal successors, (221), 54 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:41:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:05,978 INFO L225 Difference]: With dead ends: 317503 [2025-02-05 16:41:05,978 INFO L226 Difference]: Without dead ends: 269975 [2025-02-05 16:41:06,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33895 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=12761, Invalid=71629, Unknown=0, NotChecked=0, Total=84390 [2025-02-05 16:41:06,037 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 13620 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13620 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:06,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13620 Valid, 3719 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:41:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269975 states. [2025-02-05 16:41:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269975 to 149631. [2025-02-05 16:41:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149631 states, 149630 states have (on average 1.3681213660362226) internal successors, (204712), 149630 states have internal predecessors, (204712), 0 states have call successors, (0), 0 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:41:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149631 states to 149631 states and 204712 transitions. [2025-02-05 16:41:08,054 INFO L78 Accepts]: Start accepts. Automaton has 149631 states and 204712 transitions. Word has length 82 [2025-02-05 16:41:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 149631 states and 204712 transitions. [2025-02-05 16:41:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.092592592592593) internal successors, (221), 54 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:41:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 149631 states and 204712 transitions. [2025-02-05 16:41:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:41:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:08,057 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] [2025-02-05 16:41:08,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:41:08,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:08,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1667418003, now seen corresponding path program 1 times [2025-02-05 16:41:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-02-05 16:41:08,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:08,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:41:08,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:41:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-02-05 16:41:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384519333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:08,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641471141] [2025-02-05 16:41:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:08,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:08,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:08,347 INFO L87 Difference]: Start difference. First operand 149631 states and 204712 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:08,827 INFO L93 Difference]: Finished difference Result 214701 states and 293012 transitions. [2025-02-05 16:41:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:41:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:08,901 INFO L225 Difference]: With dead ends: 214701 [2025-02-05 16:41:08,901 INFO L226 Difference]: Without dead ends: 66767 [2025-02-05 16:41:08,973 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:41:08,974 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 33 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:08,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66767 states. [2025-02-05 16:41:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66767 to 65925. [2025-02-05 16:41:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65925 states, 65924 states have (on average 1.3416509920514532) internal successors, (88447), 65924 states have internal predecessors, (88447), 0 states have call successors, (0), 0 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:41:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65925 states to 65925 states and 88447 transitions. [2025-02-05 16:41:10,208 INFO L78 Accepts]: Start accepts. Automaton has 65925 states and 88447 transitions. Word has length 82 [2025-02-05 16:41:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:10,209 INFO L471 AbstractCegarLoop]: Abstraction has 65925 states and 88447 transitions. [2025-02-05 16:41:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65925 states and 88447 transitions. [2025-02-05 16:41:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:41:10,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:10,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:41:10,211 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:41:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 18842477, now seen corresponding path program 1 times [2025-02-05 16:41:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-02-05 16:41:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:10,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:41:10,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:41:10,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-02-05 16:41:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791370968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338495021] [2025-02-05 16:41:12,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:12,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:12,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:12,266 INFO L229 MonitoredProcess]: Starting monitored process 5 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:41:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:41:12,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:41:12,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:41:12,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:12,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:12,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 16:41:12,392 INFO L279 TraceCheckSpWp]: Computing forward predicates...