./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:47,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:47,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:47,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:47,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:47,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:47,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:47,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:47,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:47,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:47,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:47,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:47,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:47,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:47,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:47,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:47,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:47,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:47,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:47,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:47,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd7de77f49c6b9ff6e2bd62edbddc630c5186aa67a4c3123f05914f38eca6d7 [2025-03-03 15:07:47,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:47,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:47,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:47,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:47,637 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:47,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:07:48,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854441ff7/08f94df01f27440b8c1d867e806fb65d/FLAGb1efeb402 [2025-03-03 15:07:49,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:49,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:07:49,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854441ff7/08f94df01f27440b8c1d867e806fb65d/FLAGb1efeb402 [2025-03-03 15:07:49,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854441ff7/08f94df01f27440b8c1d867e806fb65d [2025-03-03 15:07:49,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:49,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:49,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:49,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:49,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:49,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218ff823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49, skipping insertion in model container [2025-03-03 15:07:49,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:49,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2025-03-03 15:07:49,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:49,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:49,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5377,5390] [2025-03-03 15:07:49,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:49,379 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:49,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49 WrapperNode [2025-03-03 15:07:49,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:49,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:49,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:49,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:49,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,423 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 452 [2025-03-03 15:07:49,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:49,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:49,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:49,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:49,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:07:49,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:49,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:49,456 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:49,456 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:49,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (1/1) ... [2025-03-03 15:07:49,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:49,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:07:49,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:07:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:49,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:49,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:49,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:49,941 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc main_~node2__m2~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node3__m3~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc main_~node4__m4~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:49,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L257: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:07:49,966 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:49,967 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:49,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:49,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:49,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:49 BoogieIcfgContainer [2025-03-03 15:07:49,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:49,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:49,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:49,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:49,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:49" (1/3) ... [2025-03-03 15:07:49,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d8499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:49, skipping insertion in model container [2025-03-03 15:07:49,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:49" (2/3) ... [2025-03-03 15:07:49,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d8499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:49, skipping insertion in model container [2025-03-03 15:07:49,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:49" (3/3) ... [2025-03-03 15:07:49,989 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:07:50,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:50,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 107 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:07:50,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:50,074 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;@c5d7f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:50,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:07:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:07:50,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:50,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 916889171, now seen corresponding path program 1 times [2025-03-03 15:07:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767991915] [2025-03-03 15:07:50,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:07:50,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:07:50,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767991915] [2025-03-03 15:07:50,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767991915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465135393] [2025-03-03 15:07:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:50,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,446 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,498 INFO L93 Difference]: Finished difference Result 251 states and 401 transitions. [2025-03-03 15:07:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 15:07:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,507 INFO L225 Difference]: With dead ends: 251 [2025-03-03 15:07:50,507 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 15:07:50,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,515 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:50,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 368 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 15:07:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-03-03 15:07:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2025-03-03 15:07:50,554 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 48 [2025-03-03 15:07:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2025-03-03 15:07:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2025-03-03 15:07:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 15:07:50,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:07:50,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1775842675, now seen corresponding path program 1 times [2025-03-03 15:07:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177990414] [2025-03-03 15:07:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 15:07:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 15:07:50,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177990414] [2025-03-03 15:07:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177990414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154343450] [2025-03-03 15:07:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:50,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,705 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,738 INFO L93 Difference]: Finished difference Result 403 states and 623 transitions. [2025-03-03 15:07:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-03 15:07:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,740 INFO L225 Difference]: With dead ends: 403 [2025-03-03 15:07:50,740 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 15:07:50,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,742 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 15:07:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-03-03 15:07:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5303030303030303) internal successors, (404), 264 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2025-03-03 15:07:50,761 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 49 [2025-03-03 15:07:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:50,762 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2025-03-03 15:07:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2025-03-03 15:07:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:07:50,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:07:50,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 934905645, now seen corresponding path program 1 times [2025-03-03 15:07:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019562240] [2025-03-03 15:07:50,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:07:50,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:07:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019562240] [2025-03-03 15:07:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019562240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:50,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349744598] [2025-03-03 15:07:50,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:50,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,874 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,895 INFO L93 Difference]: Finished difference Result 677 states and 1054 transitions. [2025-03-03 15:07:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:07:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,897 INFO L225 Difference]: With dead ends: 677 [2025-03-03 15:07:50,899 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 15:07:50,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:50,900 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 96 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:50,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 15:07:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2025-03-03 15:07:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5412844036697249) internal successors, (672), 436 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2025-03-03 15:07:50,938 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 50 [2025-03-03 15:07:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2025-03-03 15:07:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2025-03-03 15:07:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:07:50,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:50,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:07:50,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1321987725, now seen corresponding path program 1 times [2025-03-03 15:07:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620362835] [2025-03-03 15:07:50,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:07:50,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:07:50,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620362835] [2025-03-03 15:07:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620362835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140067103] [2025-03-03 15:07:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:51,118 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,245 INFO L93 Difference]: Finished difference Result 2487 states and 3897 transitions. [2025-03-03 15:07:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 15:07:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,257 INFO L225 Difference]: With dead ends: 2487 [2025-03-03 15:07:51,257 INFO L226 Difference]: Without dead ends: 2077 [2025-03-03 15:07:51,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:51,260 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 961 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1165 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-03-03 15:07:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 845. [2025-03-03 15:07:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5402843601895735) internal successors, (1300), 844 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1300 transitions. [2025-03-03 15:07:51,306 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1300 transitions. Word has length 51 [2025-03-03 15:07:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,306 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1300 transitions. [2025-03-03 15:07:51,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1300 transitions. [2025-03-03 15:07:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:07:51,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:51,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:07:51,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:51,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1967098179, now seen corresponding path program 1 times [2025-03-03 15:07:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686188731] [2025-03-03 15:07:51,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:07:51,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:07:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686188731] [2025-03-03 15:07:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686188731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874188491] [2025-03-03 15:07:51,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:51,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:51,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:51,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:51,507 INFO L87 Difference]: Start difference. First operand 845 states and 1300 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,588 INFO L93 Difference]: Finished difference Result 3709 states and 5720 transitions. [2025-03-03 15:07:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:07:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,598 INFO L225 Difference]: With dead ends: 3709 [2025-03-03 15:07:51,598 INFO L226 Difference]: Without dead ends: 2891 [2025-03-03 15:07:51,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:51,601 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 518 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 593 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2025-03-03 15:07:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2885. [2025-03-03 15:07:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.535367545076283) internal successors, (4428), 2884 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4428 transitions. [2025-03-03 15:07:51,650 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4428 transitions. Word has length 52 [2025-03-03 15:07:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,650 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4428 transitions. [2025-03-03 15:07:51,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4428 transitions. [2025-03-03 15:07:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:07:51,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:51,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:07:51,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1523084128, now seen corresponding path program 1 times [2025-03-03 15:07:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578515368] [2025-03-03 15:07:51,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:07:51,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:07:51,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:51,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578515368] [2025-03-03 15:07:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578515368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606343648] [2025-03-03 15:07:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:51,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:51,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:51,725 INFO L87 Difference]: Start difference. First operand 2885 states and 4428 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-03-03 15:07:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,768 INFO L93 Difference]: Finished difference Result 7769 states and 11886 transitions. [2025-03-03 15:07:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:51,769 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-03-03 15:07:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,783 INFO L225 Difference]: With dead ends: 7769 [2025-03-03 15:07:51,784 INFO L226 Difference]: Without dead ends: 4911 [2025-03-03 15:07:51,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:51,789 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 107 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2025-03-03 15:07:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4909. [2025-03-03 15:07:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 1.5118174409127954) internal successors, (7420), 4908 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 7420 transitions. [2025-03-03 15:07:51,897 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 7420 transitions. Word has length 54 [2025-03-03 15:07:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,897 INFO L471 AbstractCegarLoop]: Abstraction has 4909 states and 7420 transitions. [2025-03-03 15:07:51,897 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-03-03 15:07:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 7420 transitions. [2025-03-03 15:07:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:07:51,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:51,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:07:51,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash -592218369, now seen corresponding path program 1 times [2025-03-03 15:07:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237105958] [2025-03-03 15:07:51,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:07:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:07:51,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:51,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237105958] [2025-03-03 15:07:52,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237105958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:07:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212455594] [2025-03-03 15:07:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:52,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:52,164 INFO L87 Difference]: Start difference. First operand 4909 states and 7420 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:52,201 INFO L93 Difference]: Finished difference Result 5167 states and 7805 transitions. [2025-03-03 15:07:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 15:07:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:52,216 INFO L225 Difference]: With dead ends: 5167 [2025-03-03 15:07:52,216 INFO L226 Difference]: Without dead ends: 5165 [2025-03-03 15:07:52,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:52,219 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:52,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-03 15:07:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2025-03-03 15:07:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.4864446165762975) internal successors, (7676), 5164 states have internal predecessors, (7676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 7676 transitions. [2025-03-03 15:07:52,322 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 7676 transitions. Word has length 54 [2025-03-03 15:07:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 7676 transitions. [2025-03-03 15:07:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 7676 transitions. [2025-03-03 15:07:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 15:07:52,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:52,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:52,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:07:52,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:52,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1174131701, now seen corresponding path program 1 times [2025-03-03 15:07:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648830126] [2025-03-03 15:07:52,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 15:07:52,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 15:07:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:52,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648830126] [2025-03-03 15:07:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648830126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367990626] [2025-03-03 15:07:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:52,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:52,418 INFO L87 Difference]: Start difference. First operand 5165 states and 7676 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:52,498 INFO L93 Difference]: Finished difference Result 12539 states and 18636 transitions. [2025-03-03 15:07:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:52,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 15:07:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:52,520 INFO L225 Difference]: With dead ends: 12539 [2025-03-03 15:07:52,521 INFO L226 Difference]: Without dead ends: 7401 [2025-03-03 15:07:52,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:52,530 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:52,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2025-03-03 15:07:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 7343. [2025-03-03 15:07:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7343 states, 7342 states have (on average 1.4734404794333968) internal successors, (10818), 7342 states have internal predecessors, (10818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 10818 transitions. [2025-03-03 15:07:52,651 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 10818 transitions. Word has length 55 [2025-03-03 15:07:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:52,653 INFO L471 AbstractCegarLoop]: Abstraction has 7343 states and 10818 transitions. [2025-03-03 15:07:52,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 10818 transitions. [2025-03-03 15:07:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:52,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:52,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:07:52,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:52,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1226547920, now seen corresponding path program 1 times [2025-03-03 15:07:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74514575] [2025-03-03 15:07:52,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:52,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74514575] [2025-03-03 15:07:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74514575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134853939] [2025-03-03 15:07:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:52,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:52,723 INFO L87 Difference]: Start difference. First operand 7343 states and 10818 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:52,767 INFO L93 Difference]: Finished difference Result 17472 states and 25689 transitions. [2025-03-03 15:07:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:07:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:52,794 INFO L225 Difference]: With dead ends: 17472 [2025-03-03 15:07:52,797 INFO L226 Difference]: Without dead ends: 11638 [2025-03-03 15:07:52,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:52,805 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 83 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:52,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11638 states. [2025-03-03 15:07:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11638 to 11076. [2025-03-03 15:07:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11076 states, 11075 states have (on average 1.4563431151241535) internal successors, (16129), 11075 states have internal predecessors, (16129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 16129 transitions. [2025-03-03 15:07:52,993 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 16129 transitions. Word has length 77 [2025-03-03 15:07:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 11076 states and 16129 transitions. [2025-03-03 15:07:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 16129 transitions. [2025-03-03 15:07:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:52,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:52,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:52,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:07:52,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 289809412, now seen corresponding path program 1 times [2025-03-03 15:07:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749130898] [2025-03-03 15:07:52,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:53,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:53,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:07:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749130898] [2025-03-03 15:07:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749130898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051989682] [2025-03-03 15:07:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:53,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:53,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:53,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:53,108 INFO L87 Difference]: Start difference. First operand 11076 states and 16129 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-03-03 15:07:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:53,209 INFO L93 Difference]: Finished difference Result 21950 states and 32238 transitions. [2025-03-03 15:07:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:53,209 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-03-03 15:07:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:53,240 INFO L225 Difference]: With dead ends: 21950 [2025-03-03 15:07:53,241 INFO L226 Difference]: Without dead ends: 19976 [2025-03-03 15:07:53,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:53,250 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 778 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:53,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 854 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19976 states. [2025-03-03 15:07:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19976 to 13016. [2025-03-03 15:07:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13015 states have (on average 1.4550134460238187) internal successors, (18937), 13015 states have internal predecessors, (18937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 18937 transitions. [2025-03-03 15:07:53,477 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 18937 transitions. Word has length 77 [2025-03-03 15:07:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:53,477 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 18937 transitions. [2025-03-03 15:07:53,478 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-03-03 15:07:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 18937 transitions. [2025-03-03 15:07:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:53,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:53,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:07:53,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 891835626, now seen corresponding path program 1 times [2025-03-03 15:07:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936494902] [2025-03-03 15:07:53,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:53,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:53,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:53,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:53,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936494902] [2025-03-03 15:07:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936494902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586531373] [2025-03-03 15:07:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:53,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:53,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:53,532 INFO L87 Difference]: Start difference. First operand 13016 states and 18937 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:53,639 INFO L93 Difference]: Finished difference Result 28853 states and 41759 transitions. [2025-03-03 15:07:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:53,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:07:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:53,667 INFO L225 Difference]: With dead ends: 28853 [2025-03-03 15:07:53,667 INFO L226 Difference]: Without dead ends: 19375 [2025-03-03 15:07:53,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:53,675 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 84 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:53,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 327 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19375 states. [2025-03-03 15:07:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19375 to 18701. [2025-03-03 15:07:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18701 states, 18700 states have (on average 1.432139037433155) internal successors, (26781), 18700 states have internal predecessors, (26781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18701 states to 18701 states and 26781 transitions. [2025-03-03 15:07:53,922 INFO L78 Accepts]: Start accepts. Automaton has 18701 states and 26781 transitions. Word has length 77 [2025-03-03 15:07:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:53,922 INFO L471 AbstractCegarLoop]: Abstraction has 18701 states and 26781 transitions. [2025-03-03 15:07:53,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 18701 states and 26781 transitions. [2025-03-03 15:07:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:53,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:53,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:07:53,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:53,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash 580920302, now seen corresponding path program 1 times [2025-03-03 15:07:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046736330] [2025-03-03 15:07:53,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:53,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:53,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:53,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:07:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:54,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046736330] [2025-03-03 15:07:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046736330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:54,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:54,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711362863] [2025-03-03 15:07:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:54,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:54,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:54,056 INFO L87 Difference]: Start difference. First operand 18701 states and 26781 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-03-03 15:07:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:54,198 INFO L93 Difference]: Finished difference Result 37715 states and 54574 transitions. [2025-03-03 15:07:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:54,199 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-03-03 15:07:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:54,252 INFO L225 Difference]: With dead ends: 37715 [2025-03-03 15:07:54,252 INFO L226 Difference]: Without dead ends: 32205 [2025-03-03 15:07:54,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:54,266 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 704 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:54,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 950 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32205 states. [2025-03-03 15:07:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32205 to 24113. [2025-03-03 15:07:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24113 states, 24112 states have (on average 1.4321914399469144) internal successors, (34533), 24112 states have internal predecessors, (34533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24113 states to 24113 states and 34533 transitions. [2025-03-03 15:07:54,625 INFO L78 Accepts]: Start accepts. Automaton has 24113 states and 34533 transitions. Word has length 77 [2025-03-03 15:07:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:54,626 INFO L471 AbstractCegarLoop]: Abstraction has 24113 states and 34533 transitions. [2025-03-03 15:07:54,626 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-03-03 15:07:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 24113 states and 34533 transitions. [2025-03-03 15:07:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:07:54,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:54,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:54,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:07:54,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:54,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1568171344, now seen corresponding path program 1 times [2025-03-03 15:07:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-03-03 15:07:54,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:54,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:07:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:07:54,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:54,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:07:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-03-03 15:07:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230443781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585206791] [2025-03-03 15:07:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:54,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:54,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:54,733 INFO L87 Difference]: Start difference. First operand 24113 states and 34533 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:54,870 INFO L93 Difference]: Finished difference Result 44181 states and 63880 transitions. [2025-03-03 15:07:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:07:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:54,913 INFO L225 Difference]: With dead ends: 44181 [2025-03-03 15:07:54,913 INFO L226 Difference]: Without dead ends: 37601 [2025-03-03 15:07:54,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:54,930 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 774 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:54,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 916 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37601 states. [2025-03-03 15:07:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37601 to 29333. [2025-03-03 15:07:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29333 states, 29332 states have (on average 1.434235647074867) internal successors, (42069), 29332 states have internal predecessors, (42069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29333 states to 29333 states and 42069 transitions. [2025-03-03 15:07:55,433 INFO L78 Accepts]: Start accepts. Automaton has 29333 states and 42069 transitions. Word has length 77 [2025-03-03 15:07:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:55,434 INFO L471 AbstractCegarLoop]: Abstraction has 29333 states and 42069 transitions. [2025-03-03 15:07:55,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 29333 states and 42069 transitions. [2025-03-03 15:07:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:07:55,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:55,440 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] [2025-03-03 15:07:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:07:55,440 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1543563572, now seen corresponding path program 1 times [2025-03-03 15:07:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064937380] [2025-03-03 15:07:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:55,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:07:55,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:07:55,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:55,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064937380] [2025-03-03 15:07:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064937380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836346747] [2025-03-03 15:07:55,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:55,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:55,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:07:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:07:55,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:07:55,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:55,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:55,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 15:07:55,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:56,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:07:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836346747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:07:56,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:07:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2025-03-03 15:07:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293794313] [2025-03-03 15:07:56,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:07:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:07:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:56,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:07:56,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:07:56,925 INFO L87 Difference]: Start difference. First operand 29333 states and 42069 transitions. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,816 INFO L93 Difference]: Finished difference Result 225874 states and 321865 transitions. [2025-03-03 15:08:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-03-03 15:08:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,057 INFO L225 Difference]: With dead ends: 225874 [2025-03-03 15:08:03,057 INFO L226 Difference]: Without dead ends: 196600 [2025-03-03 15:08:03,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8102 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3569, Invalid=17023, Unknown=0, NotChecked=0, Total=20592 [2025-03-03 15:08:03,100 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 11693 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11693 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11693 Valid, 1952 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:08:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196600 states. [2025-03-03 15:08:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196600 to 167453. [2025-03-03 15:08:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167453 states, 167452 states have (on average 1.4031961397893127) internal successors, (234968), 167452 states have internal predecessors, (234968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167453 states to 167453 states and 234968 transitions. [2025-03-03 15:08:05,464 INFO L78 Accepts]: Start accepts. Automaton has 167453 states and 234968 transitions. Word has length 78 [2025-03-03 15:08:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,464 INFO L471 AbstractCegarLoop]: Abstraction has 167453 states and 234968 transitions. [2025-03-03 15:08:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167453 states and 234968 transitions. [2025-03-03 15:08:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:05,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,468 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] [2025-03-03 15:08:05,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:08:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:08:05,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1591178383, now seen corresponding path program 1 times [2025-03-03 15:08:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630810474] [2025-03-03 15:08:05,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:05,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:05,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630810474] [2025-03-03 15:08:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630810474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:05,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:05,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686419337] [2025-03-03 15:08:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:05,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:05,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:05,721 INFO L87 Difference]: Start difference. First operand 167453 states and 234968 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-03-03 15:08:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:07,156 INFO L93 Difference]: Finished difference Result 463528 states and 648435 transitions. [2025-03-03 15:08:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:07,157 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-03-03 15:08:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:07,620 INFO L225 Difference]: With dead ends: 463528 [2025-03-03 15:08:07,620 INFO L226 Difference]: Without dead ends: 308308 [2025-03-03 15:08:07,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:07,704 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 81 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:07,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 295 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308308 states. [2025-03-03 15:08:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308308 to 308306. [2025-03-03 15:08:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308306 states, 308305 states have (on average 1.3829811388073499) internal successors, (426380), 308305 states have internal predecessors, (426380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308306 states to 308306 states and 426380 transitions. [2025-03-03 15:08:11,717 INFO L78 Accepts]: Start accepts. Automaton has 308306 states and 426380 transitions. Word has length 79 [2025-03-03 15:08:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,717 INFO L471 AbstractCegarLoop]: Abstraction has 308306 states and 426380 transitions. [2025-03-03 15:08:11,717 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-03-03 15:08:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 308306 states and 426380 transitions. [2025-03-03 15:08:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:08:11,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:11,722 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1371593998, now seen corresponding path program 1 times [2025-03-03 15:08:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890994667] [2025-03-03 15:08:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:08:11,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:08:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:08:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890994667] [2025-03-03 15:08:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890994667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114898200] [2025-03-03 15:08:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:11,812 INFO L87 Difference]: Start difference. First operand 308306 states and 426380 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:13,840 INFO L93 Difference]: Finished difference Result 562631 states and 783824 transitions. [2025-03-03 15:08:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:08:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,583 INFO L225 Difference]: With dead ends: 562631 [2025-03-03 15:08:14,583 INFO L226 Difference]: Without dead ends: 486012 [2025-03-03 15:08:14,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:14,666 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 757 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 885 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486012 states. [2025-03-03 15:08:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486012 to 356819. [2025-03-03 15:08:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356819 states, 356818 states have (on average 1.383682998055031) internal successors, (493723), 356818 states have internal predecessors, (493723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356819 states to 356819 states and 493723 transitions. [2025-03-03 15:08:20,345 INFO L78 Accepts]: Start accepts. Automaton has 356819 states and 493723 transitions. Word has length 80 [2025-03-03 15:08:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 356819 states and 493723 transitions. [2025-03-03 15:08:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 356819 states and 493723 transitions. [2025-03-03 15:08:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:08:20,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:20,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 450409730, now seen corresponding path program 1 times [2025-03-03 15:08:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296990667] [2025-03-03 15:08:20,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:08:20,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:08:20,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296990667] [2025-03-03 15:08:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296990667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293558799] [2025-03-03 15:08:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,412 INFO L87 Difference]: Start difference. First operand 356819 states and 493723 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-03-03 15:08:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,137 INFO L93 Difference]: Finished difference Result 610940 states and 841147 transitions. [2025-03-03 15:08:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:22,137 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-03-03 15:08:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,689 INFO L225 Difference]: With dead ends: 610940 [2025-03-03 15:08:22,690 INFO L226 Difference]: Without dead ends: 358023 [2025-03-03 15:08:22,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:22,833 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 82 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 344 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358023 states. [2025-03-03 15:08:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358023 to 334904. [2025-03-03 15:08:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334904 states, 334903 states have (on average 1.3659089348259048) internal successors, (457447), 334903 states have internal predecessors, (457447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334904 states to 334904 states and 457447 transitions. [2025-03-03 15:08:27,528 INFO L78 Accepts]: Start accepts. Automaton has 334904 states and 457447 transitions. Word has length 82 [2025-03-03 15:08:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,529 INFO L471 AbstractCegarLoop]: Abstraction has 334904 states and 457447 transitions. [2025-03-03 15:08:27,529 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-03-03 15:08:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 334904 states and 457447 transitions. [2025-03-03 15:08:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:08:27,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:27,536 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,536 INFO L85 PathProgramCache]: Analyzing trace with hash 281220228, now seen corresponding path program 1 times [2025-03-03 15:08:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-03-03 15:08:27,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:08:27,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:08:27,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-03-03 15:08:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846734958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402591665] [2025-03-03 15:08:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:27,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:27,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:08:28,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:08:28,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:08:28,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:08:28,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:28,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402591665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:28,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:08:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423571634] [2025-03-03 15:08:28,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:28,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:28,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:28,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:28,565 INFO L87 Difference]: Start difference. First operand 334904 states and 457447 transitions. Second operand has 11 states, 11 states have (on average 13.0) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:31,161 INFO L93 Difference]: Finished difference Result 769564 states and 1057417 transitions. [2025-03-03 15:08:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:31,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.0) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:08:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:31,816 INFO L225 Difference]: With dead ends: 769564 [2025-03-03 15:08:31,816 INFO L226 Difference]: Without dead ends: 449649 [2025-03-03 15:08:31,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:08:31,921 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1210 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:31,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 581 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449649 states.