./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.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 a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:17:40,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:17:40,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:17:40,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:17:40,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:17:40,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:17:40,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:17:40,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:17:40,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:17:40,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:17:40,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:17:40,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:17:40,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:17:40,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:17:40,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:17:40,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:17:40,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:17:40,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:17:40,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:17:40,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:17:40,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:17:40,380 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 -> a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d [2025-03-08 06:17:40,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:17:40,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:17:40,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:17:40,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:17:40,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:17:40,617 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:17:41,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0943dfc/af7219cd35de41c5a646dcbbf2fcf1e7/FLAGe6a8f2dfe [2025-03-08 06:17:41,970 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:17:41,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:17:41,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0943dfc/af7219cd35de41c5a646dcbbf2fcf1e7/FLAGe6a8f2dfe [2025-03-08 06:17:42,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0943dfc/af7219cd35de41c5a646dcbbf2fcf1e7 [2025-03-08 06:17:42,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:17:42,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:17:42,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:17:42,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:17:42,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:17:42,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42, skipping insertion in model container [2025-03-08 06:17:42,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:17:42,416 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2025-03-08 06:17:42,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:17:42,442 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:17:42,473 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2025-03-08 06:17:42,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:17:42,492 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:17:42,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42 WrapperNode [2025-03-08 06:17:42,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:17:42,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:17:42,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:17:42,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:17:42,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,522 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 361 [2025-03-08 06:17:42,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:17:42,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:17:42,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:17:42,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:17:42,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,545 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:17:42,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:17:42,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:17:42,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:17:42,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:17:42,559 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (1/1) ... [2025-03-08 06:17:42,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:17:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:42,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:17:42,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:17:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:17:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:17:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:17:42,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:17:42,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:17:42,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc main_~node2__m2~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L172: havoc main_~node3__m3~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:17:42,985 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:17:43,006 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-08 06:17:43,007 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:17:43,015 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:17:43,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:17:43,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:17:43 BoogieIcfgContainer [2025-03-08 06:17:43,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:17:43,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:17:43,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:17:43,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:17:43,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:17:42" (1/3) ... [2025-03-08 06:17:43,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faf0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:17:43, skipping insertion in model container [2025-03-08 06:17:43,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:17:42" (2/3) ... [2025-03-08 06:17:43,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faf0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:17:43, skipping insertion in model container [2025-03-08 06:17:43,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:17:43" (3/3) ... [2025-03-08 06:17:43,023 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-08 06:17:43,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:17:43,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 87 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:17:43,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:17:43,079 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;@7c5bb98a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:17:43,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:17:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 06:17:43,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:43,091 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] [2025-03-08 06:17:43,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:43,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1942179841, now seen corresponding path program 1 times [2025-03-08 06:17:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299257787] [2025-03-08 06:17:43,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 06:17:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 06:17:43,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299257787] [2025-03-08 06:17:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299257787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:43,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:43,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191980674] [2025-03-08 06:17:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:43,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:43,399 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:43,440 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2025-03-08 06:17:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 06:17:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:43,448 INFO L225 Difference]: With dead ends: 205 [2025-03-08 06:17:43,449 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 06:17:43,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:43,452 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:43,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 06:17:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-08 06:17:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2025-03-08 06:17:43,475 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2025-03-08 06:17:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2025-03-08 06:17:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2025-03-08 06:17:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 06:17:43,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:43,476 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] [2025-03-08 06:17:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:17:43,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1796390494, now seen corresponding path program 1 times [2025-03-08 06:17:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693593078] [2025-03-08 06:17:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:43,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 06:17:43,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 06:17:43,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:43,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693593078] [2025-03-08 06:17:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693593078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352221423] [2025-03-08 06:17:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:43,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:43,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:43,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:43,597 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:43,619 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2025-03-08 06:17:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-08 06:17:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:43,620 INFO L225 Difference]: With dead ends: 318 [2025-03-08 06:17:43,620 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 06:17:43,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:43,621 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:43,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 06:17:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2025-03-08 06:17:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2025-03-08 06:17:43,630 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2025-03-08 06:17:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2025-03-08 06:17:43,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2025-03-08 06:17:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 06:17:43,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:43,631 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] [2025-03-08 06:17:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:17:43,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:43,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2036753029, now seen corresponding path program 1 times [2025-03-08 06:17:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020024859] [2025-03-08 06:17:43,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:43,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 06:17:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 06:17:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020024859] [2025-03-08 06:17:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020024859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:43,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999483817] [2025-03-08 06:17:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:43,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:43,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:43,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:43,764 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:43,841 INFO L93 Difference]: Finished difference Result 950 states and 1485 transitions. [2025-03-08 06:17:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-08 06:17:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:43,847 INFO L225 Difference]: With dead ends: 950 [2025-03-08 06:17:43,847 INFO L226 Difference]: Without dead ends: 764 [2025-03-08 06:17:43,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:43,848 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 501 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 697 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-08 06:17:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 390. [2025-03-08 06:17:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 597 transitions. [2025-03-08 06:17:43,879 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 597 transitions. Word has length 40 [2025-03-08 06:17:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:43,882 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 597 transitions. [2025-03-08 06:17:43,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 597 transitions. [2025-03-08 06:17:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 06:17:43,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:43,883 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] [2025-03-08 06:17:43,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:17:43,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:43,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1286120846, now seen corresponding path program 1 times [2025-03-08 06:17:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-08 06:17:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:43,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 06:17:43,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 06:17:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:44,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-08 06:17:44,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:44,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517321044] [2025-03-08 06:17:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:44,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:44,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:44,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:44,028 INFO L87 Difference]: Start difference. First operand 390 states and 597 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:44,085 INFO L93 Difference]: Finished difference Result 1348 states and 2080 transitions. [2025-03-08 06:17:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:44,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-08 06:17:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:44,088 INFO L225 Difference]: With dead ends: 1348 [2025-03-08 06:17:44,088 INFO L226 Difference]: Without dead ends: 978 [2025-03-08 06:17:44,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:44,093 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 275 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:44,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 405 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-08 06:17:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2025-03-08 06:17:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1493 transitions. [2025-03-08 06:17:44,118 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1493 transitions. Word has length 41 [2025-03-08 06:17:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:44,119 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1493 transitions. [2025-03-08 06:17:44,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1493 transitions. [2025-03-08 06:17:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 06:17:44,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:44,121 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] [2025-03-08 06:17:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:17:44,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:44,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 158631239, now seen corresponding path program 1 times [2025-03-08 06:17:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:44,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-08 06:17:44,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 06:17:44,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 06:17:44,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-08 06:17:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479692753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273274367] [2025-03-08 06:17:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:44,177 INFO L87 Difference]: Start difference. First operand 974 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:44,198 INFO L93 Difference]: Finished difference Result 2490 states and 3807 transitions. [2025-03-08 06:17:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-08 06:17:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:44,203 INFO L225 Difference]: With dead ends: 2490 [2025-03-08 06:17:44,203 INFO L226 Difference]: Without dead ends: 1536 [2025-03-08 06:17:44,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:44,206 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:44,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 275 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-08 06:17:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2025-03-08 06:17:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2309 transitions. [2025-03-08 06:17:44,244 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2309 transitions. Word has length 42 [2025-03-08 06:17:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2309 transitions. [2025-03-08 06:17:44,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2309 transitions. [2025-03-08 06:17:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 06:17:44,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:44,247 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] [2025-03-08 06:17:44,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:17:44,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -984926864, now seen corresponding path program 1 times [2025-03-08 06:17:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820586524] [2025-03-08 06:17:44,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 06:17:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 06:17:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820586524] [2025-03-08 06:17:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820586524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677496617] [2025-03-08 06:17:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:44,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:44,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:44,471 INFO L87 Difference]: Start difference. First operand 1534 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:44,495 INFO L93 Difference]: Finished difference Result 1632 states and 2454 transitions. [2025-03-08 06:17:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-08 06:17:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:44,499 INFO L225 Difference]: With dead ends: 1632 [2025-03-08 06:17:44,500 INFO L226 Difference]: Without dead ends: 1630 [2025-03-08 06:17:44,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:44,500 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 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-08 06:17:44,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-03-08 06:17:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-03-08 06:17:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.476365868631062) internal successors, (2405), 1629 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2405 transitions. [2025-03-08 06:17:44,540 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2405 transitions. Word has length 43 [2025-03-08 06:17:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2405 transitions. [2025-03-08 06:17:44,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2405 transitions. [2025-03-08 06:17:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 06:17:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:44,543 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] [2025-03-08 06:17:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:17:44,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash -463193159, now seen corresponding path program 1 times [2025-03-08 06:17:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-08 06:17:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:44,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 06:17:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 06:17:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-08 06:17:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041368720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-08 06:17:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:44,605 INFO L87 Difference]: Start difference. First operand 1630 states and 2405 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:44,630 INFO L93 Difference]: Finished difference Result 3952 states and 5841 transitions. [2025-03-08 06:17:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-08 06:17:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:44,637 INFO L225 Difference]: With dead ends: 3952 [2025-03-08 06:17:44,637 INFO L226 Difference]: Without dead ends: 2342 [2025-03-08 06:17:44,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:44,641 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 216 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-08 06:17:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 216 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-08 06:17:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2320. [2025-03-08 06:17:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.4639931004743423) internal successors, (3395), 2319 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3395 transitions. [2025-03-08 06:17:44,677 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3395 transitions. Word has length 44 [2025-03-08 06:17:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:44,677 INFO L471 AbstractCegarLoop]: Abstraction has 2320 states and 3395 transitions. [2025-03-08 06:17:44,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3395 transitions. [2025-03-08 06:17:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:17:44,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:44,678 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] [2025-03-08 06:17:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:17:44,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1185335861, now seen corresponding path program 1 times [2025-03-08 06:17:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023752551] [2025-03-08 06:17:44,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:44,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:17:44,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:17:44,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:44,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023752551] [2025-03-08 06:17:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023752551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523531740] [2025-03-08 06:17:45,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:45,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:45,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:45,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:45,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:17:45,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:17:45,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:17:45,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:45,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 06:17:45,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:17:45,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:17:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523531740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:45,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:45,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2025-03-08 06:17:45,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079222416] [2025-03-08 06:17:45,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:45,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 06:17:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:45,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 06:17:45,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:17:45,454 INFO L87 Difference]: Start difference. First operand 2320 states and 3395 transitions. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 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-08 06:17:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:47,156 INFO L93 Difference]: Finished difference Result 14102 states and 20577 transitions. [2025-03-08 06:17:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-08 06:17:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 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) Word has length 63 [2025-03-08 06:17:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:47,192 INFO L225 Difference]: With dead ends: 14102 [2025-03-08 06:17:47,193 INFO L226 Difference]: Without dead ends: 11804 [2025-03-08 06:17:47,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=684, Invalid=3098, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 06:17:47,199 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 2952 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:47,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1621 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:17:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2025-03-08 06:17:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 10732. [2025-03-08 06:17:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10732 states, 10731 states have (on average 1.4385425403037928) internal successors, (15437), 10731 states have internal predecessors, (15437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10732 states to 10732 states and 15437 transitions. [2025-03-08 06:17:47,375 INFO L78 Accepts]: Start accepts. Automaton has 10732 states and 15437 transitions. Word has length 63 [2025-03-08 06:17:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:47,376 INFO L471 AbstractCegarLoop]: Abstraction has 10732 states and 15437 transitions. [2025-03-08 06:17:47,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 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-08 06:17:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10732 states and 15437 transitions. [2025-03-08 06:17:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:17:47,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:47,378 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] [2025-03-08 06:17:47,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:17:47,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:47,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1991240922, now seen corresponding path program 1 times [2025-03-08 06:17:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-08 06:17:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:47,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:17:47,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:17:47,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:47,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-08 06:17:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:47,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78794410] [2025-03-08 06:17:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:47,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:47,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:47,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:47,637 INFO L87 Difference]: Start difference. First operand 10732 states and 15437 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:47,688 INFO L93 Difference]: Finished difference Result 23805 states and 34156 transitions. [2025-03-08 06:17:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:17:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:47,726 INFO L225 Difference]: With dead ends: 23805 [2025-03-08 06:17:47,726 INFO L226 Difference]: Without dead ends: 16047 [2025-03-08 06:17:47,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:47,739 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:47,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16047 states. [2025-03-08 06:17:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16047 to 14941. [2025-03-08 06:17:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14941 states, 14940 states have (on average 1.417536813922356) internal successors, (21178), 14940 states have internal predecessors, (21178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14941 states to 14941 states and 21178 transitions. [2025-03-08 06:17:47,964 INFO L78 Accepts]: Start accepts. Automaton has 14941 states and 21178 transitions. Word has length 63 [2025-03-08 06:17:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:47,965 INFO L471 AbstractCegarLoop]: Abstraction has 14941 states and 21178 transitions. [2025-03-08 06:17:47,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 14941 states and 21178 transitions. [2025-03-08 06:17:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:17:47,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:47,967 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] [2025-03-08 06:17:47,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:17:47,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1389214708, now seen corresponding path program 1 times [2025-03-08 06:17:47,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-03-08 06:17:47,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:17:47,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:17:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 06:17:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-03-08 06:17:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932029002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117562771] [2025-03-08 06:17:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:48,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:48,044 INFO L87 Difference]: Start difference. First operand 14941 states and 21178 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:48,132 INFO L93 Difference]: Finished difference Result 27497 states and 39066 transitions. [2025-03-08 06:17:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:17:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:48,206 INFO L225 Difference]: With dead ends: 27497 [2025-03-08 06:17:48,206 INFO L226 Difference]: Without dead ends: 23527 [2025-03-08 06:17:48,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:48,214 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 357 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:48,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 546 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23527 states. [2025-03-08 06:17:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23527 to 18725. [2025-03-08 06:17:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18725 states, 18724 states have (on average 1.4109164708395643) internal successors, (26418), 18724 states have internal predecessors, (26418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18725 states to 18725 states and 26418 transitions. [2025-03-08 06:17:48,425 INFO L78 Accepts]: Start accepts. Automaton has 18725 states and 26418 transitions. Word has length 63 [2025-03-08 06:17:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:48,425 INFO L471 AbstractCegarLoop]: Abstraction has 18725 states and 26418 transitions. [2025-03-08 06:17:48,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 18725 states and 26418 transitions. [2025-03-08 06:17:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:17:48,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:48,427 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] [2025-03-08 06:17:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:17:48,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2047745110, now seen corresponding path program 1 times [2025-03-08 06:17:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:48,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-03-08 06:17:48,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:17:48,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:17:48,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:48,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 06:17:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430810940] [2025-03-08 06:17:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430810940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:48,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103065869] [2025-03-08 06:17:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:48,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:48,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:48,551 INFO L87 Difference]: Start difference. First operand 18725 states and 26418 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:48,694 INFO L93 Difference]: Finished difference Result 33061 states and 46924 transitions. [2025-03-08 06:17:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:17:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:48,732 INFO L225 Difference]: With dead ends: 33061 [2025-03-08 06:17:48,732 INFO L226 Difference]: Without dead ends: 27231 [2025-03-08 06:17:48,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:48,741 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 354 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:48,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 600 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2025-03-08 06:17:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 23965. [2025-03-08 06:17:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23965 states, 23964 states have (on average 1.4076948756468035) internal successors, (33734), 23964 states have internal predecessors, (33734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23965 states to 23965 states and 33734 transitions. [2025-03-08 06:17:49,053 INFO L78 Accepts]: Start accepts. Automaton has 23965 states and 33734 transitions. Word has length 63 [2025-03-08 06:17:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 23965 states and 33734 transitions. [2025-03-08 06:17:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23965 states and 33734 transitions. [2025-03-08 06:17:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:17:49,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:49,056 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:17:49,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:17:49,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:49,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash 659118657, now seen corresponding path program 1 times [2025-03-08 06:17:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-03-08 06:17:49,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:49,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:17:49,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:17:49,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:49,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-03-08 06:17:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540273047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995683] [2025-03-08 06:17:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:49,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:49,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:49,105 INFO L87 Difference]: Start difference. First operand 23965 states and 33734 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:49,303 INFO L93 Difference]: Finished difference Result 60789 states and 84794 transitions. [2025-03-08 06:17:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:49,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:17:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:49,345 INFO L225 Difference]: With dead ends: 60789 [2025-03-08 06:17:49,345 INFO L226 Difference]: Without dead ends: 40475 [2025-03-08 06:17:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:49,359 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:49,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 231 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40475 states. [2025-03-08 06:17:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40475 to 40473. [2025-03-08 06:17:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40473 states, 40472 states have (on average 1.373986953943467) internal successors, (55608), 40472 states have internal predecessors, (55608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40473 states to 40473 states and 55608 transitions. [2025-03-08 06:17:49,743 INFO L78 Accepts]: Start accepts. Automaton has 40473 states and 55608 transitions. Word has length 64 [2025-03-08 06:17:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:49,744 INFO L471 AbstractCegarLoop]: Abstraction has 40473 states and 55608 transitions. [2025-03-08 06:17:49,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40473 states and 55608 transitions. [2025-03-08 06:17:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:17:49,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:49,747 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:17:49,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:17:49,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:49,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2012182625, now seen corresponding path program 1 times [2025-03-08 06:17:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005646857] [2025-03-08 06:17:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:49,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:17:49,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:17:49,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:49,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:17:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005646857] [2025-03-08 06:17:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005646857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:49,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:17:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563625523] [2025-03-08 06:17:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:49,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:17:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:49,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:17:49,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:17:49,813 INFO L87 Difference]: Start difference. First operand 40473 states and 55608 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:50,022 INFO L93 Difference]: Finished difference Result 63205 states and 87557 transitions. [2025-03-08 06:17:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:17:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:17:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:50,084 INFO L225 Difference]: With dead ends: 63205 [2025-03-08 06:17:50,085 INFO L226 Difference]: Without dead ends: 53931 [2025-03-08 06:17:50,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:17:50,106 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 349 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:50,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 557 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:17:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53931 states. [2025-03-08 06:17:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53931 to 47059. [2025-03-08 06:17:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47059 states, 47058 states have (on average 1.3732840324705682) internal successors, (64624), 47058 states have internal predecessors, (64624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47059 states to 47059 states and 64624 transitions. [2025-03-08 06:17:50,865 INFO L78 Accepts]: Start accepts. Automaton has 47059 states and 64624 transitions. Word has length 64 [2025-03-08 06:17:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 47059 states and 64624 transitions. [2025-03-08 06:17:50,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 47059 states and 64624 transitions. [2025-03-08 06:17:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:17:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:50,870 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] [2025-03-08 06:17:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:17:50,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1356646996, now seen corresponding path program 1 times [2025-03-08 06:17:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-03-08 06:17:50,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:17:50,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:17:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:50,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:50,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105338790] [2025-03-08 06:17:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105338790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152691588] [2025-03-08 06:17:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:50,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:50,929 INFO L87 Difference]: Start difference. First operand 47059 states and 64624 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:51,087 INFO L93 Difference]: Finished difference Result 85397 states and 116380 transitions. [2025-03-08 06:17:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:51,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:17:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:51,146 INFO L225 Difference]: With dead ends: 85397 [2025-03-08 06:17:51,146 INFO L226 Difference]: Without dead ends: 48037 [2025-03-08 06:17:51,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:51,185 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:51,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 289 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48037 states. [2025-03-08 06:17:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48037 to 46622. [2025-03-08 06:17:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46622 states, 46621 states have (on average 1.3531670277342829) internal successors, (63086), 46621 states have internal predecessors, (63086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46622 states to 46622 states and 63086 transitions. [2025-03-08 06:17:51,751 INFO L78 Accepts]: Start accepts. Automaton has 46622 states and 63086 transitions. Word has length 66 [2025-03-08 06:17:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 46622 states and 63086 transitions. [2025-03-08 06:17:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46622 states and 63086 transitions. [2025-03-08 06:17:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:17:51,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:51,755 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] [2025-03-08 06:17:51,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:17:51,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -83047502, now seen corresponding path program 1 times [2025-03-08 06:17:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615880761] [2025-03-08 06:17:51,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:51,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:17:51,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:17:51,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:51,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615880761] [2025-03-08 06:17:51,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615880761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171761447] [2025-03-08 06:17:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:51,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:51,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:17:51,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:17:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:17:51,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:51,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:51,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:17:51,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:52,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171761447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:52,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:17:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174655211] [2025-03-08 06:17:52,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:17:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:17:52,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:17:52,158 INFO L87 Difference]: Start difference. First operand 46622 states and 63086 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:52,666 INFO L93 Difference]: Finished difference Result 118338 states and 161131 transitions. [2025-03-08 06:17:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:17:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 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 68 [2025-03-08 06:17:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:52,751 INFO L225 Difference]: With dead ends: 118338 [2025-03-08 06:17:52,751 INFO L226 Difference]: Without dead ends: 80427 [2025-03-08 06:17:52,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:17:52,787 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1062 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:52,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 364 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:17:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80427 states. [2025-03-08 06:17:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80427 to 54959. [2025-03-08 06:17:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54959 states, 54958 states have (on average 1.354725426689472) internal successors, (74453), 54958 states have internal predecessors, (74453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 74453 transitions. [2025-03-08 06:17:53,525 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 74453 transitions. Word has length 68 [2025-03-08 06:17:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:53,525 INFO L471 AbstractCegarLoop]: Abstraction has 54959 states and 74453 transitions. [2025-03-08 06:17:53,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 74453 transitions. [2025-03-08 06:17:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:17:53,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:53,529 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:17:53,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:17:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 06:17:53,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -183660597, now seen corresponding path program 1 times [2025-03-08 06:17:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32538532] [2025-03-08 06:17:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:17:53,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:17:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:53,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32538532] [2025-03-08 06:17:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32538532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310845558] [2025-03-08 06:17:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:53,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:53,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:53,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:17:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:17:53,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:17:53,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:53,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:17:53,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:54,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310845558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:54,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:54,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:17:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-03-08 06:17:54,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:17:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:54,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:17:54,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:17:54,243 INFO L87 Difference]: Start difference. First operand 54959 states and 74453 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:54,586 INFO L93 Difference]: Finished difference Result 107409 states and 145881 transitions. [2025-03-08 06:17:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:17:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 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 69 [2025-03-08 06:17:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:54,674 INFO L225 Difference]: With dead ends: 107409 [2025-03-08 06:17:54,674 INFO L226 Difference]: Without dead ends: 81432 [2025-03-08 06:17:54,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:17:54,709 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 632 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:54,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 327 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:17:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81432 states. [2025-03-08 06:17:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81432 to 64088. [2025-03-08 06:17:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64088 states, 64087 states have (on average 1.352193112487712) internal successors, (86658), 64087 states have internal predecessors, (86658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64088 states to 64088 states and 86658 transitions. [2025-03-08 06:17:55,660 INFO L78 Accepts]: Start accepts. Automaton has 64088 states and 86658 transitions. Word has length 69 [2025-03-08 06:17:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:55,660 INFO L471 AbstractCegarLoop]: Abstraction has 64088 states and 86658 transitions. [2025-03-08 06:17:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 10 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 64088 states and 86658 transitions. [2025-03-08 06:17:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:17:55,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:55,665 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:17:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:17:55,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:55,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:55,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash -630074835, now seen corresponding path program 1 times [2025-03-08 06:17:55,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:55,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-03-08 06:17:55,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:55,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:55,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:17:55,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:17:55,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:55,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-03-08 06:17:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130870248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:17:55,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107803535] [2025-03-08 06:17:55,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:55,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:17:55,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:17:55,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:17:55,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:17:55,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:17:56,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:17:56,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:56,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:17:56,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:17:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:56,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:17:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107803535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:17:56,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:17:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:17:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730005312] [2025-03-08 06:17:56,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:17:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:17:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:56,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:17:56,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:17:56,262 INFO L87 Difference]: Start difference. First operand 64088 states and 86658 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:56,811 INFO L93 Difference]: Finished difference Result 127804 states and 172146 transitions. [2025-03-08 06:17:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:17:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 69 [2025-03-08 06:17:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:56,898 INFO L225 Difference]: With dead ends: 127804 [2025-03-08 06:17:56,899 INFO L226 Difference]: Without dead ends: 76255 [2025-03-08 06:17:56,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:17:56,923 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 634 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:56,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 338 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:17:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76255 states. [2025-03-08 06:17:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76255 to 65004. [2025-03-08 06:17:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65004 states, 65003 states have (on average 1.3456302016829993) internal successors, (87470), 65003 states have internal predecessors, (87470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65004 states to 65004 states and 87470 transitions. [2025-03-08 06:17:57,594 INFO L78 Accepts]: Start accepts. Automaton has 65004 states and 87470 transitions. Word has length 69 [2025-03-08 06:17:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:57,594 INFO L471 AbstractCegarLoop]: Abstraction has 65004 states and 87470 transitions. [2025-03-08 06:17:57,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 65004 states and 87470 transitions. [2025-03-08 06:17:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:17:57,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:57,599 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] [2025-03-08 06:17:57,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:17:57,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:17:57,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash -592419664, now seen corresponding path program 1 times [2025-03-08 06:17:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079478368] [2025-03-08 06:17:57,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:57,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:17:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:17:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:17:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079478368] [2025-03-08 06:17:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079478368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276749282] [2025-03-08 06:17:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:57,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:57,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:57,835 INFO L87 Difference]: Start difference. First operand 65004 states and 87470 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 06:17:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:58,173 INFO L93 Difference]: Finished difference Result 91452 states and 122769 transitions. [2025-03-08 06:17:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2025-03-08 06:17:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:58,243 INFO L225 Difference]: With dead ends: 91452 [2025-03-08 06:17:58,243 INFO L226 Difference]: Without dead ends: 59060 [2025-03-08 06:17:58,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:58,271 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 65 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:58,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59060 states. [2025-03-08 06:17:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59060 to 59041. [2025-03-08 06:17:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59041 states, 59040 states have (on average 1.3282181571815719) internal successors, (78418), 59040 states have internal predecessors, (78418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59041 states to 59041 states and 78418 transitions. [2025-03-08 06:17:58,936 INFO L78 Accepts]: Start accepts. Automaton has 59041 states and 78418 transitions. Word has length 70 [2025-03-08 06:17:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:17:58,936 INFO L471 AbstractCegarLoop]: Abstraction has 59041 states and 78418 transitions. [2025-03-08 06:17:58,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 06:17:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 59041 states and 78418 transitions. [2025-03-08 06:17:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:17:58,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:17:58,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:17:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:17:58,941 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:17:58,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:17:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1181590271, now seen corresponding path program 1 times [2025-03-08 06:17:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:17:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986774512] [2025-03-08 06:17:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:17:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:17:58,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:17:58,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:17:58,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:17:58,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:17:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 06:17:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:17:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986774512] [2025-03-08 06:17:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986774512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:17:58,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:17:58,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:17:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410434281] [2025-03-08 06:17:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:17:58,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:17:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:17:58,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:17:58,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:58,975 INFO L87 Difference]: Start difference. First operand 59041 states and 78418 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:17:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:17:59,405 INFO L93 Difference]: Finished difference Result 118824 states and 157848 transitions. [2025-03-08 06:17:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:17:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:17:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:17:59,502 INFO L225 Difference]: With dead ends: 118824 [2025-03-08 06:17:59,502 INFO L226 Difference]: Without dead ends: 92405 [2025-03-08 06:17:59,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:17:59,531 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:17:59,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 202 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:17:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92405 states. [2025-03-08 06:18:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92405 to 66931. [2025-03-08 06:18:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66931 states, 66930 states have (on average 1.3219632451815329) internal successors, (88479), 66930 states have internal predecessors, (88479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66931 states to 66931 states and 88479 transitions. [2025-03-08 06:18:00,434 INFO L78 Accepts]: Start accepts. Automaton has 66931 states and 88479 transitions. Word has length 71 [2025-03-08 06:18:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:00,434 INFO L471 AbstractCegarLoop]: Abstraction has 66931 states and 88479 transitions. [2025-03-08 06:18:00,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 66931 states and 88479 transitions. [2025-03-08 06:18:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:18:00,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:00,439 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:18:00,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:18:00,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1173042191, now seen corresponding path program 1 times [2025-03-08 06:18:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339903538] [2025-03-08 06:18:00,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:00,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:18:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:18:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339903538] [2025-03-08 06:18:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339903538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:18:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623108958] [2025-03-08 06:18:00,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:00,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:18:00,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:18:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:18:00,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:18:00,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:00,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:00,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:18:00,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:18:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:01,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:18:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623108958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:18:01,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:18:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:18:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634143851] [2025-03-08 06:18:01,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:18:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:18:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:01,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:18:01,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:18:01,775 INFO L87 Difference]: Start difference. First operand 66931 states and 88479 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:03,222 INFO L93 Difference]: Finished difference Result 304490 states and 402634 transitions. [2025-03-08 06:18:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:18:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 06:18:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:03,518 INFO L225 Difference]: With dead ends: 304490 [2025-03-08 06:18:03,518 INFO L226 Difference]: Without dead ends: 237564 [2025-03-08 06:18:03,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 06:18:03,561 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1689 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:03,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1150 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:18:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237564 states. [2025-03-08 06:18:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237564 to 144982. [2025-03-08 06:18:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144982 states, 144981 states have (on average 1.314999896538167) internal successors, (190650), 144981 states have internal predecessors, (190650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144982 states to 144982 states and 190650 transitions. [2025-03-08 06:18:05,647 INFO L78 Accepts]: Start accepts. Automaton has 144982 states and 190650 transitions. Word has length 71 [2025-03-08 06:18:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:05,647 INFO L471 AbstractCegarLoop]: Abstraction has 144982 states and 190650 transitions. [2025-03-08 06:18:05,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 144982 states and 190650 transitions. [2025-03-08 06:18:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:18:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:05,654 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:18:05,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:18:05,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:05,855 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 571015977, now seen corresponding path program 1 times [2025-03-08 06:18:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-03-08 06:18:05,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:18:05,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:18:05,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:05,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949401269] [2025-03-08 06:18:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949401269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:18:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566363766] [2025-03-08 06:18:06,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:06,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:18:06,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:18:06,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:18:06,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:18:06,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:18:06,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:06,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:18:06,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:18:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:06,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:18:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566363766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:18:06,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:18:06,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 06:18:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944446822] [2025-03-08 06:18:06,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:18:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:18:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:18:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:18:06,894 INFO L87 Difference]: Start difference. First operand 144982 states and 190650 transitions. Second operand has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:08,352 INFO L93 Difference]: Finished difference Result 382023 states and 502859 transitions. [2025-03-08 06:18:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 06:18:08,353 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 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 71 [2025-03-08 06:18:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:08,827 INFO L225 Difference]: With dead ends: 382023 [2025-03-08 06:18:08,827 INFO L226 Difference]: Without dead ends: 310350 [2025-03-08 06:18:08,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 06:18:08,942 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1198 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:08,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1083 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:18:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310350 states. [2025-03-08 06:18:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310350 to 237411. [2025-03-08 06:18:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237411 states, 237410 states have (on average 1.3038793648119287) internal successors, (309554), 237410 states have internal predecessors, (309554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237411 states to 237411 states and 309554 transitions. [2025-03-08 06:18:12,171 INFO L78 Accepts]: Start accepts. Automaton has 237411 states and 309554 transitions. Word has length 71 [2025-03-08 06:18:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 237411 states and 309554 transitions. [2025-03-08 06:18:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 237411 states and 309554 transitions. [2025-03-08 06:18:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:18:12,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:12,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:12,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:18:12,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:18:12,383 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1098774681, now seen corresponding path program 1 times [2025-03-08 06:18:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-08 06:18:12,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:18:12,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:18:12,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749649798] [2025-03-08 06:18:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749649798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:12,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207137433] [2025-03-08 06:18:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:12,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:12,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:12,427 INFO L87 Difference]: Start difference. First operand 237411 states and 309554 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-08 06:18:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:13,682 INFO L93 Difference]: Finished difference Result 289813 states and 377106 transitions. [2025-03-08 06:18:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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 72 [2025-03-08 06:18:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:13,969 INFO L225 Difference]: With dead ends: 289813 [2025-03-08 06:18:13,969 INFO L226 Difference]: Without dead ends: 207489 [2025-03-08 06:18:14,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:14,011 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 62 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:14,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207489 states. [2025-03-08 06:18:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207489 to 207487. [2025-03-08 06:18:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207487 states, 207486 states have (on average 1.2863614894498907) internal successors, (266902), 207486 states have internal predecessors, (266902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207487 states to 207487 states and 266902 transitions. [2025-03-08 06:18:16,197 INFO L78 Accepts]: Start accepts. Automaton has 207487 states and 266902 transitions. Word has length 72 [2025-03-08 06:18:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:16,197 INFO L471 AbstractCegarLoop]: Abstraction has 207487 states and 266902 transitions. [2025-03-08 06:18:16,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-08 06:18:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 207487 states and 266902 transitions. [2025-03-08 06:18:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:18:16,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:16,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:16,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:18:16,206 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1229706862, now seen corresponding path program 1 times [2025-03-08 06:18:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:16,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108251800] [2025-03-08 06:18:16,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:16,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:18:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:18:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:18:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108251800] [2025-03-08 06:18:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108251800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184415937] [2025-03-08 06:18:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:16,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:16,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:16,259 INFO L87 Difference]: Start difference. First operand 207487 states and 266902 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-08 06:18:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:17,566 INFO L93 Difference]: Finished difference Result 346303 states and 444714 transitions. [2025-03-08 06:18:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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 72 [2025-03-08 06:18:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:17,753 INFO L225 Difference]: With dead ends: 346303 [2025-03-08 06:18:17,753 INFO L226 Difference]: Without dead ends: 138922 [2025-03-08 06:18:17,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:17,869 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:17,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 248 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138922 states. [2025-03-08 06:18:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138922 to 138444. [2025-03-08 06:18:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138444 states, 138443 states have (on average 1.2577811807025274) internal successors, (174131), 138443 states have internal predecessors, (174131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138444 states to 138444 states and 174131 transitions. [2025-03-08 06:18:19,911 INFO L78 Accepts]: Start accepts. Automaton has 138444 states and 174131 transitions. Word has length 72 [2025-03-08 06:18:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 138444 states and 174131 transitions. [2025-03-08 06:18:19,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-08 06:18:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 138444 states and 174131 transitions. [2025-03-08 06:18:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:18:19,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:19,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:18:19,916 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:19,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1839571117, now seen corresponding path program 1 times [2025-03-08 06:18:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098056896] [2025-03-08 06:18:19,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:19,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:18:19,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:18:19,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:18:19,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098056896] [2025-03-08 06:18:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098056896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887692028] [2025-03-08 06:18:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:19,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:19,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:19,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:19,942 INFO L87 Difference]: Start difference. First operand 138444 states and 174131 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 06:18:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:20,430 INFO L93 Difference]: Finished difference Result 268193 states and 337913 transitions. [2025-03-08 06:18:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 72 [2025-03-08 06:18:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:20,597 INFO L225 Difference]: With dead ends: 268193 [2025-03-08 06:18:20,598 INFO L226 Difference]: Without dead ends: 130144 [2025-03-08 06:18:20,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:20,693 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:20,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130144 states. [2025-03-08 06:18:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130144 to 128838. [2025-03-08 06:18:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128838 states, 128837 states have (on average 1.2469088848700296) internal successors, (160648), 128837 states have internal predecessors, (160648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128838 states to 128838 states and 160648 transitions. [2025-03-08 06:18:22,538 INFO L78 Accepts]: Start accepts. Automaton has 128838 states and 160648 transitions. Word has length 72 [2025-03-08 06:18:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:22,538 INFO L471 AbstractCegarLoop]: Abstraction has 128838 states and 160648 transitions. [2025-03-08 06:18:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-08 06:18:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 128838 states and 160648 transitions. [2025-03-08 06:18:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:18:22,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:22,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:18:22,544 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1383289901, now seen corresponding path program 1 times [2025-03-08 06:18:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452797522] [2025-03-08 06:18:22,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:22,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:18:22,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:18:22,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:22,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:18:22,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452797522] [2025-03-08 06:18:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452797522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:22,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041479782] [2025-03-08 06:18:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:22,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:22,581 INFO L87 Difference]: Start difference. First operand 128838 states and 160648 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:23,143 INFO L93 Difference]: Finished difference Result 240643 states and 300487 transitions. [2025-03-08 06:18:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:23,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 06:18:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:23,292 INFO L225 Difference]: With dead ends: 240643 [2025-03-08 06:18:23,292 INFO L226 Difference]: Without dead ends: 112416 [2025-03-08 06:18:23,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:23,372 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 83 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:23,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:18:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112416 states. [2025-03-08 06:18:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112416 to 110274. [2025-03-08 06:18:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110274 states, 110273 states have (on average 1.2289681064267772) internal successors, (135522), 110273 states have internal predecessors, (135522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110274 states to 110274 states and 135522 transitions. [2025-03-08 06:18:24,746 INFO L78 Accepts]: Start accepts. Automaton has 110274 states and 135522 transitions. Word has length 72 [2025-03-08 06:18:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:18:24,746 INFO L471 AbstractCegarLoop]: Abstraction has 110274 states and 135522 transitions. [2025-03-08 06:18:24,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 110274 states and 135522 transitions. [2025-03-08 06:18:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:18:24,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:18:24,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:18:24,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:18:24,750 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:18:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:18:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1242103670, now seen corresponding path program 1 times [2025-03-08 06:18:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:18:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-08 06:18:24,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:18:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:18:24,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:18:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:18:24,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:18:24,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:18:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:18:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:18:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-08 06:18:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248904282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:18:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:18:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:18:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449705537] [2025-03-08 06:18:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:18:24,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:18:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:18:24,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:18:24,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:24,774 INFO L87 Difference]: Start difference. First operand 110274 states and 135522 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:18:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:18:25,572 INFO L93 Difference]: Finished difference Result 202960 states and 249801 transitions. [2025-03-08 06:18:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:18:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 72 [2025-03-08 06:18:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:18:25,698 INFO L225 Difference]: With dead ends: 202960 [2025-03-08 06:18:25,699 INFO L226 Difference]: Without dead ends: 94960 [2025-03-08 06:18:25,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:18:25,737 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 88 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:18:25,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 135 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:18:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94960 states. [2025-03-08 06:18:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94960 to 94308. [2025-03-08 06:18:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94308 states, 94307 states have (on average 1.218371913007518) internal successors, (114901), 94307 states have internal predecessors, (114901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)