./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-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 e1221f43edcd55fb28cc2c33b3cd78828237d81c097e561fccaa486cdd56e141 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:56,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:56,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:56,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:56,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:56,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:56,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:56,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:56,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:56,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:56,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:56,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:56,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:56,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:56,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:56,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:56,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:56,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:56,217 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 -> e1221f43edcd55fb28cc2c33b3cd78828237d81c097e561fccaa486cdd56e141 [2025-03-03 15:07:56,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:56,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:56,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:56,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:56,427 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:56,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:07:57,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a363e7143/effad206ccc4460793d582b5d64e35aa/FLAG7c368186e [2025-03-03 15:07:57,863 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:57,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:07:57,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a363e7143/effad206ccc4460793d582b5d64e35aa/FLAG7c368186e [2025-03-03 15:07:58,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a363e7143/effad206ccc4460793d582b5d64e35aa [2025-03-03 15:07:58,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:58,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:58,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:58,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:58,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:58,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503646d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58, skipping insertion in model container [2025-03-03 15:07:58,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:58,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2025-03-03 15:07:58,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:58,424 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:58,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7107,7120] [2025-03-03 15:07:58,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:58,495 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:58,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58 WrapperNode [2025-03-03 15:07:58,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:58,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:58,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:58,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:58,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,533 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 695 [2025-03-03 15:07:58,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:58,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:58,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:58,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:58,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,554 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:07:58,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:58,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:58,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:58,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:58,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (1/1) ... [2025-03-03 15:07:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:58,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:07:58,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:07:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:58,704 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:58,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node2__m2~2#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node3__m3~2#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node4__m4~2#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L380: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:59,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:59,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:59,162 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:59,162 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:59,173 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:59,173 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:59,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:59 BoogieIcfgContainer [2025-03-03 15:07:59,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:59,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:59,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:59,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:59,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:58" (1/3) ... [2025-03-03 15:07:59,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178e8891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:59, skipping insertion in model container [2025-03-03 15:07:59,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:58" (2/3) ... [2025-03-03 15:07:59,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178e8891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:59, skipping insertion in model container [2025-03-03 15:07:59,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:59" (3/3) ... [2025-03-03 15:07:59,181 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:07:59,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:59,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 170 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:07:59,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:59,241 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;@2f2331b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:59,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:07:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:07:59,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:59,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:59,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash -973195421, now seen corresponding path program 1 times [2025-03-03 15:07:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436556852] [2025-03-03 15:07:59,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:07:59,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:07:59,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:59,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436556852] [2025-03-03 15:07:59,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436556852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:59,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:59,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719892320] [2025-03-03 15:07:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:07:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:07:59,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:07:59,723 INFO L87 Difference]: Start difference. First operand has 170 states, 168 states have (on average 1.7202380952380953) internal successors, (289), 169 states have internal predecessors, (289), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-03 15:07:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:59,884 INFO L93 Difference]: Finished difference Result 605 states and 979 transitions. [2025-03-03 15:07:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:07:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-03 15:07:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:59,897 INFO L225 Difference]: With dead ends: 605 [2025-03-03 15:07:59,897 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 15:07:59,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:59,903 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1375 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:59,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1732 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 15:07:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 260. [2025-03-03 15:07:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2025-03-03 15:07:59,952 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 63 [2025-03-03 15:07:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:59,953 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2025-03-03 15:07:59,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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-03 15:07:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2025-03-03 15:07:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:59,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:07:59,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:59,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash -103326567, now seen corresponding path program 1 times [2025-03-03 15:07:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261924361] [2025-03-03 15:07:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:08:00,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:08:00,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261924361] [2025-03-03 15:08:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261924361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659001701] [2025-03-03 15:08:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:00,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:00,189 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-03 15:08:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,310 INFO L93 Difference]: Finished difference Result 968 states and 1495 transitions. [2025-03-03 15:08:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-03 15:08:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,313 INFO L225 Difference]: With dead ends: 968 [2025-03-03 15:08:00,316 INFO L226 Difference]: Without dead ends: 766 [2025-03-03 15:08:00,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:00,318 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1107 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 759 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-03 15:08:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 760. [2025-03-03 15:08:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.533596837944664) internal successors, (1164), 759 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1164 transitions. [2025-03-03 15:08:00,353 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1164 transitions. Word has length 64 [2025-03-03 15:08:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,354 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1164 transitions. [2025-03-03 15:08:00,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-03 15:08:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1164 transitions. [2025-03-03 15:08:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:00,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:08:00,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 686613698, now seen corresponding path program 1 times [2025-03-03 15:08:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830107143] [2025-03-03 15:08:00,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:00,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:00,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830107143] [2025-03-03 15:08:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830107143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504346816] [2025-03-03 15:08:00,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:00,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:00,496 INFO L87 Difference]: Start difference. First operand 760 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,706 INFO L93 Difference]: Finished difference Result 1922 states and 2990 transitions. [2025-03-03 15:08:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:08:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,714 INFO L225 Difference]: With dead ends: 1922 [2025-03-03 15:08:00,715 INFO L226 Difference]: Without dead ends: 1258 [2025-03-03 15:08:00,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:00,719 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 880 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 239 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-03 15:08:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2025-03-03 15:08:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1255 states have (on average 1.544223107569721) internal successors, (1938), 1255 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1938 transitions. [2025-03-03 15:08:00,760 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1938 transitions. Word has length 65 [2025-03-03 15:08:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1938 transitions. [2025-03-03 15:08:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1938 transitions. [2025-03-03 15:08:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:00,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:08:00,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -341678226, now seen corresponding path program 1 times [2025-03-03 15:08:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126908537] [2025-03-03 15:08:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:00,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:00,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126908537] [2025-03-03 15:08:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126908537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791043850] [2025-03-03 15:08:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:00,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:00,895 INFO L87 Difference]: Start difference. First operand 1256 states and 1938 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,078 INFO L93 Difference]: Finished difference Result 3463 states and 5393 transitions. [2025-03-03 15:08:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:08:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,088 INFO L225 Difference]: With dead ends: 3463 [2025-03-03 15:08:01,088 INFO L226 Difference]: Without dead ends: 2276 [2025-03-03 15:08:01,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:01,092 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 902 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 239 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-03-03 15:08:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2274. [2025-03-03 15:08:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 1.5477342718873734) internal successors, (3518), 2273 states have internal predecessors, (3518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3518 transitions. [2025-03-03 15:08:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3518 transitions. Word has length 65 [2025-03-03 15:08:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,138 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 3518 transitions. [2025-03-03 15:08:01,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3518 transitions. [2025-03-03 15:08:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:08:01,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:01,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:08:01,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2101261338, now seen corresponding path program 1 times [2025-03-03 15:08:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708746542] [2025-03-03 15:08:01,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:08:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:08:01,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708746542] [2025-03-03 15:08:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708746542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738279463] [2025-03-03 15:08:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:01,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:01,234 INFO L87 Difference]: Start difference. First operand 2274 states and 3518 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,408 INFO L93 Difference]: Finished difference Result 6560 states and 10206 transitions. [2025-03-03 15:08:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 15:08:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,421 INFO L225 Difference]: With dead ends: 6560 [2025-03-03 15:08:01,422 INFO L226 Difference]: Without dead ends: 4332 [2025-03-03 15:08:01,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:01,426 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 928 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 237 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2025-03-03 15:08:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4330. [2025-03-03 15:08:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.5456225456225456) internal successors, (6691), 4329 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6691 transitions. [2025-03-03 15:08:01,503 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6691 transitions. Word has length 65 [2025-03-03 15:08:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 6691 transitions. [2025-03-03 15:08:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6691 transitions. [2025-03-03 15:08:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:01,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:01,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:08:01,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1995301184, now seen corresponding path program 1 times [2025-03-03 15:08:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65691404] [2025-03-03 15:08:01,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:01,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65691404] [2025-03-03 15:08:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65691404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:01,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268224355] [2025-03-03 15:08:01,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:01,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:01,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:01,610 INFO L87 Difference]: Start difference. First operand 4330 states and 6691 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03 15:08:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,784 INFO L93 Difference]: Finished difference Result 11798 states and 18286 transitions. [2025-03-03 15:08:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03 15:08:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,806 INFO L225 Difference]: With dead ends: 11798 [2025-03-03 15:08:01,806 INFO L226 Difference]: Without dead ends: 7516 [2025-03-03 15:08:01,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:01,814 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 961 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 240 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-03-03 15:08:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7514. [2025-03-03 15:08:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.5417276720351392) internal successors, (11583), 7513 states have internal predecessors, (11583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 11583 transitions. [2025-03-03 15:08:01,956 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 11583 transitions. Word has length 66 [2025-03-03 15:08:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,956 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 11583 transitions. [2025-03-03 15:08:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03 15:08:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 11583 transitions. [2025-03-03 15:08:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:08:01,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:08:01,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 963624315, now seen corresponding path program 1 times [2025-03-03 15:08:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588030176] [2025-03-03 15:08:01,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:08:01,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:08:01,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588030176] [2025-03-03 15:08:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588030176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:08:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202965809] [2025-03-03 15:08:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:08:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:02,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:08:02,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:02,218 INFO L87 Difference]: Start difference. First operand 7514 states and 11583 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03 15:08:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,251 INFO L93 Difference]: Finished difference Result 7740 states and 11920 transitions. [2025-03-03 15:08:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03 15:08:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:02,279 INFO L225 Difference]: With dead ends: 7740 [2025-03-03 15:08:02,280 INFO L226 Difference]: Without dead ends: 7738 [2025-03-03 15:08:02,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:02,283 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:02,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 918 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7738 states. [2025-03-03 15:08:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7738 to 7738. [2025-03-03 15:08:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 7737 states have (on average 1.5260436861832751) internal successors, (11807), 7737 states have internal predecessors, (11807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 11807 transitions. [2025-03-03 15:08:02,428 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 11807 transitions. Word has length 66 [2025-03-03 15:08:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:02,429 INFO L471 AbstractCegarLoop]: Abstraction has 7738 states and 11807 transitions. [2025-03-03 15:08:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03 15:08:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 11807 transitions. [2025-03-03 15:08:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:02,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:02,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:02,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:08:02,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:02,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash -187643647, now seen corresponding path program 1 times [2025-03-03 15:08:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039107391] [2025-03-03 15:08:02,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:02,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:02,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:02,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:02,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:02,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039107391] [2025-03-03 15:08:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039107391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668276334] [2025-03-03 15:08:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:02,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:02,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:02,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:02,697 INFO L87 Difference]: Start difference. First operand 7738 states and 11807 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:03,091 INFO L93 Difference]: Finished difference Result 10287 states and 15559 transitions. [2025-03-03 15:08:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:03,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,108 INFO L225 Difference]: With dead ends: 10287 [2025-03-03 15:08:03,108 INFO L226 Difference]: Without dead ends: 9075 [2025-03-03 15:08:03,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:03,114 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 917 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 708 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9075 states. [2025-03-03 15:08:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9075 to 7738. [2025-03-03 15:08:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7738 states, 7737 states have (on average 1.5259144371203308) internal successors, (11806), 7737 states have internal predecessors, (11806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 11806 transitions. [2025-03-03 15:08:03,235 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 11806 transitions. Word has length 67 [2025-03-03 15:08:03,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,236 INFO L471 AbstractCegarLoop]: Abstraction has 7738 states and 11806 transitions. [2025-03-03 15:08:03,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 11806 transitions. [2025-03-03 15:08:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:03,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:03,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:03,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1672262785, now seen corresponding path program 1 times [2025-03-03 15:08:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739383360] [2025-03-03 15:08:03,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:03,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:03,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739383360] [2025-03-03 15:08:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739383360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280938973] [2025-03-03 15:08:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:03,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:03,536 INFO L87 Difference]: Start difference. First operand 7738 states and 11806 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,052 INFO L93 Difference]: Finished difference Result 13819 states and 20900 transitions. [2025-03-03 15:08:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,071 INFO L225 Difference]: With dead ends: 13819 [2025-03-03 15:08:04,072 INFO L226 Difference]: Without dead ends: 10482 [2025-03-03 15:08:04,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:08:04,078 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1470 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 757 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10482 states. [2025-03-03 15:08:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10482 to 7906. [2025-03-03 15:08:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7906 states, 7905 states have (on average 1.522707147375079) internal successors, (12037), 7905 states have internal predecessors, (12037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7906 states to 7906 states and 12037 transitions. [2025-03-03 15:08:04,241 INFO L78 Accepts]: Start accepts. Automaton has 7906 states and 12037 transitions. Word has length 67 [2025-03-03 15:08:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,241 INFO L471 AbstractCegarLoop]: Abstraction has 7906 states and 12037 transitions. [2025-03-03 15:08:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7906 states and 12037 transitions. [2025-03-03 15:08:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:04,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:04,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:04,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:04,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -475602943, now seen corresponding path program 1 times [2025-03-03 15:08:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134345703] [2025-03-03 15:08:04,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:04,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:04,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134345703] [2025-03-03 15:08:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134345703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920672554] [2025-03-03 15:08:04,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:04,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:04,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:04,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:04,524 INFO L87 Difference]: Start difference. First operand 7906 states and 12037 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:05,018 INFO L93 Difference]: Finished difference Result 17251 states and 26058 transitions. [2025-03-03 15:08:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:08:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:05,040 INFO L225 Difference]: With dead ends: 17251 [2025-03-03 15:08:05,040 INFO L226 Difference]: Without dead ends: 11811 [2025-03-03 15:08:05,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:08:05,048 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1384 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:05,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 807 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2025-03-03 15:08:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 8094. [2025-03-03 15:08:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8094 states, 8093 states have (on average 1.517237118497467) internal successors, (12279), 8093 states have internal predecessors, (12279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 12279 transitions. [2025-03-03 15:08:05,181 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 12279 transitions. Word has length 67 [2025-03-03 15:08:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 8094 states and 12279 transitions. [2025-03-03 15:08:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 12279 transitions. [2025-03-03 15:08:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:05,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash -815822597, now seen corresponding path program 1 times [2025-03-03 15:08:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850245331] [2025-03-03 15:08:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:05,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:05,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:05,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850245331] [2025-03-03 15:08:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850245331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:08:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474613634] [2025-03-03 15:08:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:05,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:05,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:05,480 INFO L87 Difference]: Start difference. First operand 8094 states and 12279 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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-03 15:08:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,073 INFO L93 Difference]: Finished difference Result 20274 states and 30690 transitions. [2025-03-03 15:08:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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 68 [2025-03-03 15:08:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,092 INFO L225 Difference]: With dead ends: 20274 [2025-03-03 15:08:06,092 INFO L226 Difference]: Without dead ends: 12839 [2025-03-03 15:08:06,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:06,102 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1024 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1307 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12839 states. [2025-03-03 15:08:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12839 to 8244. [2025-03-03 15:08:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8244 states, 8243 states have (on average 1.5098871769986655) internal successors, (12446), 8243 states have internal predecessors, (12446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8244 states to 8244 states and 12446 transitions. [2025-03-03 15:08:06,233 INFO L78 Accepts]: Start accepts. Automaton has 8244 states and 12446 transitions. Word has length 68 [2025-03-03 15:08:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:06,233 INFO L471 AbstractCegarLoop]: Abstraction has 8244 states and 12446 transitions. [2025-03-03 15:08:06,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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-03 15:08:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8244 states and 12446 transitions. [2025-03-03 15:08:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:06,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:06,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:06,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:06,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash 196832413, now seen corresponding path program 1 times [2025-03-03 15:08:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016641659] [2025-03-03 15:08:06,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:06,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:06,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:06,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016641659] [2025-03-03 15:08:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016641659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:06,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775626756] [2025-03-03 15:08:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:06,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:06,284 INFO L87 Difference]: Start difference. First operand 8244 states and 12446 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-03 15:08:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,328 INFO L93 Difference]: Finished difference Result 17482 states and 26536 transitions. [2025-03-03 15:08:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:06,329 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 68 [2025-03-03 15:08:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,346 INFO L225 Difference]: With dead ends: 17482 [2025-03-03 15:08:06,346 INFO L226 Difference]: Without dead ends: 10882 [2025-03-03 15:08:06,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:06,355 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 164 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 453 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10882 states. [2025-03-03 15:08:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10882 to 7900. [2025-03-03 15:08:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.491201417901) internal successors, (11779), 7899 states have internal predecessors, (11779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11779 transitions. [2025-03-03 15:08:06,458 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11779 transitions. Word has length 68 [2025-03-03 15:08:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 11779 transitions. [2025-03-03 15:08:06,458 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-03-03 15:08:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11779 transitions. [2025-03-03 15:08:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:06,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:06,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:06,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:06,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 988502843, now seen corresponding path program 1 times [2025-03-03 15:08:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:06,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77979021] [2025-03-03 15:08:06,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:06,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:06,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:06,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:06,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77979021] [2025-03-03 15:08:06,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77979021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:08:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906972259] [2025-03-03 15:08:06,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:08:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:08:06,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:08:06,570 INFO L87 Difference]: Start difference. First operand 7900 states and 11779 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-03 15:08:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,622 INFO L93 Difference]: Finished difference Result 20976 states and 31525 transitions. [2025-03-03 15:08:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:08:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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 68 [2025-03-03 15:08:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,644 INFO L225 Difference]: With dead ends: 20976 [2025-03-03 15:08:06,644 INFO L226 Difference]: Without dead ends: 14094 [2025-03-03 15:08:06,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:08:06,653 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 157 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 568 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14094 states. [2025-03-03 15:08:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14094 to 13980. [2025-03-03 15:08:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13980 states, 13979 states have (on average 1.4852993776378853) internal successors, (20763), 13979 states have internal predecessors, (20763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13980 states to 13980 states and 20763 transitions. [2025-03-03 15:08:06,829 INFO L78 Accepts]: Start accepts. Automaton has 13980 states and 20763 transitions. Word has length 68 [2025-03-03 15:08:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 13980 states and 20763 transitions. [2025-03-03 15:08:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-03 15:08:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 13980 states and 20763 transitions. [2025-03-03 15:08:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:06,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:06,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:06,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1932218012, now seen corresponding path program 1 times [2025-03-03 15:08:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210291560] [2025-03-03 15:08:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:06,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:06,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:06,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:06,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:06,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210291560] [2025-03-03 15:08:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210291560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:06,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460219] [2025-03-03 15:08:06,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:06,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:06,878 INFO L87 Difference]: Start difference. First operand 13980 states and 20763 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-03 15:08:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:06,934 INFO L93 Difference]: Finished difference Result 19814 states and 29388 transitions. [2025-03-03 15:08:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:06,935 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 68 [2025-03-03 15:08:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:06,962 INFO L225 Difference]: With dead ends: 19814 [2025-03-03 15:08:06,963 INFO L226 Difference]: Without dead ends: 15482 [2025-03-03 15:08:06,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:06,972 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 136 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:06,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 522 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15482 states. [2025-03-03 15:08:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15482 to 13624. [2025-03-03 15:08:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13624 states, 13623 states have (on average 1.458415914262644) internal successors, (19868), 13623 states have internal predecessors, (19868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13624 states to 13624 states and 19868 transitions. [2025-03-03 15:08:07,155 INFO L78 Accepts]: Start accepts. Automaton has 13624 states and 19868 transitions. Word has length 68 [2025-03-03 15:08:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,155 INFO L471 AbstractCegarLoop]: Abstraction has 13624 states and 19868 transitions. [2025-03-03 15:08:07,156 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-03-03 15:08:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13624 states and 19868 transitions. [2025-03-03 15:08:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:07,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:07,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:07,159 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:07,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 102373885, now seen corresponding path program 1 times [2025-03-03 15:08:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347470449] [2025-03-03 15:08:07,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:07,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:07,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347470449] [2025-03-03 15:08:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347470449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665057980] [2025-03-03 15:08:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:07,213 INFO L87 Difference]: Start difference. First operand 13624 states and 19868 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-03 15:08:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:07,265 INFO L93 Difference]: Finished difference Result 23260 states and 33992 transitions. [2025-03-03 15:08:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:07,266 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 68 [2025-03-03 15:08:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:07,290 INFO L225 Difference]: With dead ends: 23260 [2025-03-03 15:08:07,290 INFO L226 Difference]: Without dead ends: 15574 [2025-03-03 15:08:07,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:07,300 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 146 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:07,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 472 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2025-03-03 15:08:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 15364. [2025-03-03 15:08:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15364 states, 15363 states have (on average 1.431361062292521) internal successors, (21990), 15363 states have internal predecessors, (21990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 21990 transitions. [2025-03-03 15:08:07,527 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 21990 transitions. Word has length 68 [2025-03-03 15:08:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 15364 states and 21990 transitions. [2025-03-03 15:08:07,527 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-03-03 15:08:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 21990 transitions. [2025-03-03 15:08:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:07,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:07,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:07,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash -196898366, now seen corresponding path program 1 times [2025-03-03 15:08:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830159702] [2025-03-03 15:08:07,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:07,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:07,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:07,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:07,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830159702] [2025-03-03 15:08:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830159702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:07,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:07,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115575326] [2025-03-03 15:08:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:07,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:07,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:07,567 INFO L87 Difference]: Start difference. First operand 15364 states and 21990 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-03 15:08:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:07,637 INFO L93 Difference]: Finished difference Result 29711 states and 42435 transitions. [2025-03-03 15:08:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:07,637 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 69 [2025-03-03 15:08:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:07,660 INFO L225 Difference]: With dead ends: 29711 [2025-03-03 15:08:07,660 INFO L226 Difference]: Without dead ends: 16777 [2025-03-03 15:08:07,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:07,674 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 156 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:07,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 437 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16777 states. [2025-03-03 15:08:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16777 to 16607. [2025-03-03 15:08:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16607 states, 16606 states have (on average 1.392328074190052) internal successors, (23121), 16606 states have internal predecessors, (23121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16607 states to 16607 states and 23121 transitions. [2025-03-03 15:08:07,821 INFO L78 Accepts]: Start accepts. Automaton has 16607 states and 23121 transitions. Word has length 69 [2025-03-03 15:08:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,821 INFO L471 AbstractCegarLoop]: Abstraction has 16607 states and 23121 transitions. [2025-03-03 15:08:07,821 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-03 15:08:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 16607 states and 23121 transitions. [2025-03-03 15:08:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:07,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:07,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2084471006, now seen corresponding path program 1 times [2025-03-03 15:08:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643691902] [2025-03-03 15:08:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:07,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:07,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:07,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643691902] [2025-03-03 15:08:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643691902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:07,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111656605] [2025-03-03 15:08:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:07,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:07,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:07,898 INFO L87 Difference]: Start difference. First operand 16607 states and 23121 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:08,006 INFO L93 Difference]: Finished difference Result 31122 states and 43718 transitions. [2025-03-03 15:08:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:08,046 INFO L225 Difference]: With dead ends: 31122 [2025-03-03 15:08:08,046 INFO L226 Difference]: Without dead ends: 29212 [2025-03-03 15:08:08,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:08,058 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1041 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:08,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1068 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29212 states. [2025-03-03 15:08:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29212 to 18488. [2025-03-03 15:08:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18488 states, 18487 states have (on average 1.393141126196787) internal successors, (25755), 18487 states have internal predecessors, (25755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18488 states to 18488 states and 25755 transitions. [2025-03-03 15:08:08,371 INFO L78 Accepts]: Start accepts. Automaton has 18488 states and 25755 transitions. Word has length 69 [2025-03-03 15:08:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:08,371 INFO L471 AbstractCegarLoop]: Abstraction has 18488 states and 25755 transitions. [2025-03-03 15:08:08,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18488 states and 25755 transitions. [2025-03-03 15:08:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:08,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:08,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:08,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:08,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:08,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1807784670, now seen corresponding path program 1 times [2025-03-03 15:08:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997385194] [2025-03-03 15:08:08,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:08,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:08,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:08,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:08,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997385194] [2025-03-03 15:08:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997385194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:08,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634934104] [2025-03-03 15:08:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:08,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:08,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:08,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:08,451 INFO L87 Difference]: Start difference. First operand 18488 states and 25755 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:08,568 INFO L93 Difference]: Finished difference Result 35255 states and 49544 transitions. [2025-03-03 15:08:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:08,606 INFO L225 Difference]: With dead ends: 35255 [2025-03-03 15:08:08,607 INFO L226 Difference]: Without dead ends: 31041 [2025-03-03 15:08:08,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:08,620 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 971 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:08,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1126 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31041 states. [2025-03-03 15:08:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31041 to 22654. [2025-03-03 15:08:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22654 states, 22653 states have (on average 1.3937226857369884) internal successors, (31572), 22653 states have internal predecessors, (31572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22654 states to 22654 states and 31572 transitions. [2025-03-03 15:08:08,890 INFO L78 Accepts]: Start accepts. Automaton has 22654 states and 31572 transitions. Word has length 69 [2025-03-03 15:08:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:08,890 INFO L471 AbstractCegarLoop]: Abstraction has 22654 states and 31572 transitions. [2025-03-03 15:08:08,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 22654 states and 31572 transitions. [2025-03-03 15:08:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:08,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:08,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:08,892 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -150751232, now seen corresponding path program 1 times [2025-03-03 15:08:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308996587] [2025-03-03 15:08:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:08,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:08,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:08,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308996587] [2025-03-03 15:08:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308996587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:08,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934845526] [2025-03-03 15:08:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:08,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:08,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:08,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:08,971 INFO L87 Difference]: Start difference. First operand 22654 states and 31572 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:09,110 INFO L93 Difference]: Finished difference Result 41569 states and 58415 transitions. [2025-03-03 15:08:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:08:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:09,149 INFO L225 Difference]: With dead ends: 41569 [2025-03-03 15:08:09,149 INFO L226 Difference]: Without dead ends: 35147 [2025-03-03 15:08:09,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:09,163 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1010 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:09,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1208 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35147 states. [2025-03-03 15:08:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35147 to 27515. [2025-03-03 15:08:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27515 states, 27514 states have (on average 1.3961982990477575) internal successors, (38415), 27514 states have internal predecessors, (38415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27515 states to 27515 states and 38415 transitions. [2025-03-03 15:08:09,586 INFO L78 Accepts]: Start accepts. Automaton has 27515 states and 38415 transitions. Word has length 69 [2025-03-03 15:08:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:09,586 INFO L471 AbstractCegarLoop]: Abstraction has 27515 states and 38415 transitions. [2025-03-03 15:08:09,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 27515 states and 38415 transitions. [2025-03-03 15:08:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:09,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:09,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:09,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:09,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:09,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -863478180, now seen corresponding path program 1 times [2025-03-03 15:08:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53214246] [2025-03-03 15:08:09,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:09,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:09,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53214246] [2025-03-03 15:08:09,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53214246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:09,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:09,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782903863] [2025-03-03 15:08:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:09,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:09,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:09,684 INFO L87 Difference]: Start difference. First operand 27515 states and 38415 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:09,871 INFO L93 Difference]: Finished difference Result 49383 states and 69339 transitions. [2025-03-03 15:08:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:09,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:08:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:09,919 INFO L225 Difference]: With dead ends: 49383 [2025-03-03 15:08:09,919 INFO L226 Difference]: Without dead ends: 41465 [2025-03-03 15:08:09,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:09,939 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1016 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:09,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1100 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41465 states. [2025-03-03 15:08:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41465 to 31545. [2025-03-03 15:08:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31545 states, 31544 states have (on average 1.397001014455998) internal successors, (44067), 31544 states have internal predecessors, (44067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31545 states to 31545 states and 44067 transitions. [2025-03-03 15:08:10,421 INFO L78 Accepts]: Start accepts. Automaton has 31545 states and 44067 transitions. Word has length 70 [2025-03-03 15:08:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:10,422 INFO L471 AbstractCegarLoop]: Abstraction has 31545 states and 44067 transitions. [2025-03-03 15:08:10,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 31545 states and 44067 transitions. [2025-03-03 15:08:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:10,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:10,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:10,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:10,425 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:10,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 628869756, now seen corresponding path program 1 times [2025-03-03 15:08:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377514383] [2025-03-03 15:08:10,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:10,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:10,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:10,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:10,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:10,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:10,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377514383] [2025-03-03 15:08:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377514383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266722737] [2025-03-03 15:08:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:10,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:10,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:10,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:10,515 INFO L87 Difference]: Start difference. First operand 31545 states and 44067 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:10,999 INFO L93 Difference]: Finished difference Result 93883 states and 130258 transitions. [2025-03-03 15:08:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:10,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:08:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,097 INFO L225 Difference]: With dead ends: 93883 [2025-03-03 15:08:11,097 INFO L226 Difference]: Without dead ends: 82296 [2025-03-03 15:08:11,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:11,130 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1533 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 439 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82296 states. [2025-03-03 15:08:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82296 to 31691. [2025-03-03 15:08:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31691 states, 31690 states have (on average 1.3960555380246134) internal successors, (44241), 31690 states have internal predecessors, (44241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31691 states to 31691 states and 44241 transitions. [2025-03-03 15:08:11,744 INFO L78 Accepts]: Start accepts. Automaton has 31691 states and 44241 transitions. Word has length 74 [2025-03-03 15:08:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 31691 states and 44241 transitions. [2025-03-03 15:08:11,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31691 states and 44241 transitions. [2025-03-03 15:08:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:11,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:11,748 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1651806399, now seen corresponding path program 1 times [2025-03-03 15:08:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71519930] [2025-03-03 15:08:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:11,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71519930] [2025-03-03 15:08:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71519930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117388375] [2025-03-03 15:08:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:11,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:11,832 INFO L87 Difference]: Start difference. First operand 31691 states and 44241 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:12,342 INFO L93 Difference]: Finished difference Result 75376 states and 105212 transitions. [2025-03-03 15:08:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:12,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:08:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:12,412 INFO L225 Difference]: With dead ends: 75376 [2025-03-03 15:08:12,412 INFO L226 Difference]: Without dead ends: 65146 [2025-03-03 15:08:12,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:12,430 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1690 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:12,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 455 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65146 states. [2025-03-03 15:08:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65146 to 31703. [2025-03-03 15:08:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31703 states, 31702 states have (on average 1.3960317961011923) internal successors, (44257), 31702 states have internal predecessors, (44257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31703 states to 31703 states and 44257 transitions. [2025-03-03 15:08:12,846 INFO L78 Accepts]: Start accepts. Automaton has 31703 states and 44257 transitions. Word has length 74 [2025-03-03 15:08:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:12,846 INFO L471 AbstractCegarLoop]: Abstraction has 31703 states and 44257 transitions. [2025-03-03 15:08:12,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31703 states and 44257 transitions. [2025-03-03 15:08:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:12,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:12,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:12,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:12,849 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 498846083, now seen corresponding path program 1 times [2025-03-03 15:08:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097838240] [2025-03-03 15:08:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:12,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:12,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:12,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:12,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097838240] [2025-03-03 15:08:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097838240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513664760] [2025-03-03 15:08:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:12,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:12,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:12,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:12,922 INFO L87 Difference]: Start difference. First operand 31703 states and 44257 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:13,293 INFO L93 Difference]: Finished difference Result 74536 states and 103068 transitions. [2025-03-03 15:08:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:13,368 INFO L225 Difference]: With dead ends: 74536 [2025-03-03 15:08:13,369 INFO L226 Difference]: Without dead ends: 68693 [2025-03-03 15:08:13,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:13,393 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1318 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:13,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 431 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68693 states. [2025-03-03 15:08:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68693 to 31935. [2025-03-03 15:08:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31935 states, 31934 states have (on average 1.3943759002943572) internal successors, (44528), 31934 states have internal predecessors, (44528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31935 states to 31935 states and 44528 transitions. [2025-03-03 15:08:13,890 INFO L78 Accepts]: Start accepts. Automaton has 31935 states and 44528 transitions. Word has length 75 [2025-03-03 15:08:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 31935 states and 44528 transitions. [2025-03-03 15:08:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 31935 states and 44528 transitions. [2025-03-03 15:08:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:13,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:13,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:13,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:13,893 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -448403452, now seen corresponding path program 1 times [2025-03-03 15:08:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215318660] [2025-03-03 15:08:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:13,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:13,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:13,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215318660] [2025-03-03 15:08:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215318660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448435911] [2025-03-03 15:08:13,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:13,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:13,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:13,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:13,959 INFO L87 Difference]: Start difference. First operand 31935 states and 44528 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,272 INFO L93 Difference]: Finished difference Result 80858 states and 112135 transitions. [2025-03-03 15:08:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:14,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 15:08:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,335 INFO L225 Difference]: With dead ends: 80858 [2025-03-03 15:08:14,335 INFO L226 Difference]: Without dead ends: 59849 [2025-03-03 15:08:14,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:14,360 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1153 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 395 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59849 states. [2025-03-03 15:08:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59849 to 31985. [2025-03-03 15:08:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31985 states, 31984 states have (on average 1.394072036018009) internal successors, (44588), 31984 states have internal predecessors, (44588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31985 states to 31985 states and 44588 transitions. [2025-03-03 15:08:14,772 INFO L78 Accepts]: Start accepts. Automaton has 31985 states and 44588 transitions. Word has length 75 [2025-03-03 15:08:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 31985 states and 44588 transitions. [2025-03-03 15:08:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 31985 states and 44588 transitions. [2025-03-03 15:08:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:14,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:14,776 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash -149569058, now seen corresponding path program 1 times [2025-03-03 15:08:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736124427] [2025-03-03 15:08:14,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:14,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:14,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736124427] [2025-03-03 15:08:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736124427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:15,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027983731] [2025-03-03 15:08:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:15,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:15,341 INFO L87 Difference]: Start difference. First operand 31985 states and 44588 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,041 INFO L93 Difference]: Finished difference Result 57664 states and 80434 transitions. [2025-03-03 15:08:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-03 15:08:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,109 INFO L225 Difference]: With dead ends: 57664 [2025-03-03 15:08:16,109 INFO L226 Difference]: Without dead ends: 53864 [2025-03-03 15:08:16,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:16,131 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1289 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1860 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53864 states. [2025-03-03 15:08:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53864 to 31998. [2025-03-03 15:08:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31998 states, 31997 states have (on average 1.3936931587336312) internal successors, (44594), 31997 states have internal predecessors, (44594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31998 states to 31998 states and 44594 transitions. [2025-03-03 15:08:16,651 INFO L78 Accepts]: Start accepts. Automaton has 31998 states and 44594 transitions. Word has length 76 [2025-03-03 15:08:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,652 INFO L471 AbstractCegarLoop]: Abstraction has 31998 states and 44594 transitions. [2025-03-03 15:08:16,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31998 states and 44594 transitions. [2025-03-03 15:08:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:16,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:16,656 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -384025370, now seen corresponding path program 1 times [2025-03-03 15:08:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916842839] [2025-03-03 15:08:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:16,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:16,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916842839] [2025-03-03 15:08:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916842839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897726090] [2025-03-03 15:08:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:17,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:17,152 INFO L87 Difference]: Start difference. First operand 31998 states and 44594 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,921 INFO L93 Difference]: Finished difference Result 71995 states and 100832 transitions. [2025-03-03 15:08:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:08:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:17,989 INFO L225 Difference]: With dead ends: 71995 [2025-03-03 15:08:17,989 INFO L226 Difference]: Without dead ends: 59092 [2025-03-03 15:08:18,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:08:18,013 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 881 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 2642 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59092 states. [2025-03-03 15:08:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59092 to 31813. [2025-03-03 15:08:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31813 states, 31812 states have (on average 1.3943794794417201) internal successors, (44358), 31812 states have internal predecessors, (44358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31813 states to 31813 states and 44358 transitions. [2025-03-03 15:08:18,599 INFO L78 Accepts]: Start accepts. Automaton has 31813 states and 44358 transitions. Word has length 77 [2025-03-03 15:08:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:18,599 INFO L471 AbstractCegarLoop]: Abstraction has 31813 states and 44358 transitions. [2025-03-03 15:08:18,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 31813 states and 44358 transitions. [2025-03-03 15:08:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:18,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:18,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:18,603 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:18,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -149684488, now seen corresponding path program 1 times [2025-03-03 15:08:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694090383] [2025-03-03 15:08:18,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:18,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:18,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:18,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694090383] [2025-03-03 15:08:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694090383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329856228] [2025-03-03 15:08:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:18,643 INFO L87 Difference]: Start difference. First operand 31813 states and 44358 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:18,814 INFO L93 Difference]: Finished difference Result 66986 states and 93538 transitions. [2025-03-03 15:08:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:18,867 INFO L225 Difference]: With dead ends: 66986 [2025-03-03 15:08:18,867 INFO L226 Difference]: Without dead ends: 45567 [2025-03-03 15:08:18,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:18,892 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 175 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 345 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45567 states. [2025-03-03 15:08:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45567 to 45397. [2025-03-03 15:08:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45397 states, 45396 states have (on average 1.398691514670896) internal successors, (63495), 45396 states have internal predecessors, (63495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45397 states to 45397 states and 63495 transitions. [2025-03-03 15:08:19,529 INFO L78 Accepts]: Start accepts. Automaton has 45397 states and 63495 transitions. Word has length 78 [2025-03-03 15:08:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,529 INFO L471 AbstractCegarLoop]: Abstraction has 45397 states and 63495 transitions. [2025-03-03 15:08:19,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 45397 states and 63495 transitions. [2025-03-03 15:08:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:08:19,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:19,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:19,534 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -928674664, now seen corresponding path program 1 times [2025-03-03 15:08:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361116532] [2025-03-03 15:08:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:08:19,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:08:19,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361116532] [2025-03-03 15:08:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361116532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068339296] [2025-03-03 15:08:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:19,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:19,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,566 INFO L87 Difference]: Start difference. First operand 45397 states and 63495 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,738 INFO L93 Difference]: Finished difference Result 91224 states and 127710 transitions. [2025-03-03 15:08:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:08:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,805 INFO L225 Difference]: With dead ends: 91224 [2025-03-03 15:08:19,805 INFO L226 Difference]: Without dead ends: 62639 [2025-03-03 15:08:19,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,839 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 162 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 343 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62639 states. [2025-03-03 15:08:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62639 to 40964. [2025-03-03 15:08:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40964 states, 40963 states have (on average 1.4000683543685766) internal successors, (57351), 40963 states have internal predecessors, (57351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 57351 transitions. [2025-03-03 15:08:20,351 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 57351 transitions. Word has length 81 [2025-03-03 15:08:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,351 INFO L471 AbstractCegarLoop]: Abstraction has 40964 states and 57351 transitions. [2025-03-03 15:08:20,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 57351 transitions. [2025-03-03 15:08:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:08:20,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:20,355 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -842160129, now seen corresponding path program 1 times [2025-03-03 15:08:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266813923] [2025-03-03 15:08:20,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:08:20,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:08:20,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266813923] [2025-03-03 15:08:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266813923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42886511] [2025-03-03 15:08:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,390 INFO L87 Difference]: Start difference. First operand 40964 states and 57351 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,504 INFO L93 Difference]: Finished difference Result 59259 states and 82805 transitions. [2025-03-03 15:08:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:08:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,546 INFO L225 Difference]: With dead ends: 59259 [2025-03-03 15:08:20,546 INFO L226 Difference]: Without dead ends: 35397 [2025-03-03 15:08:20,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,569 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35397 states. [2025-03-03 15:08:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35397 to 35395. [2025-03-03 15:08:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35395 states, 35394 states have (on average 1.3837373566141153) internal successors, (48976), 35394 states have internal predecessors, (48976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35395 states to 35395 states and 48976 transitions. [2025-03-03 15:08:20,922 INFO L78 Accepts]: Start accepts. Automaton has 35395 states and 48976 transitions. Word has length 81 [2025-03-03 15:08:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,922 INFO L471 AbstractCegarLoop]: Abstraction has 35395 states and 48976 transitions. [2025-03-03 15:08:20,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35395 states and 48976 transitions. [2025-03-03 15:08:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:08:20,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:20,927 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:20,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 981433150, now seen corresponding path program 1 times [2025-03-03 15:08:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442044619] [2025-03-03 15:08:20,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:08:20,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:08:20,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442044619] [2025-03-03 15:08:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442044619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231372380] [2025-03-03 15:08:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,962 INFO L87 Difference]: Start difference. First operand 35395 states and 48976 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,097 INFO L93 Difference]: Finished difference Result 69603 states and 96460 transitions. [2025-03-03 15:08:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:08:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,146 INFO L225 Difference]: With dead ends: 69603 [2025-03-03 15:08:21,146 INFO L226 Difference]: Without dead ends: 48941 [2025-03-03 15:08:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,170 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 171 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 347 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48941 states. [2025-03-03 15:08:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48941 to 34377. [2025-03-03 15:08:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34377 states, 34376 states have (on average 1.3821561554572959) internal successors, (47513), 34376 states have internal predecessors, (47513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34377 states to 34377 states and 47513 transitions. [2025-03-03 15:08:21,572 INFO L78 Accepts]: Start accepts. Automaton has 34377 states and 47513 transitions. Word has length 82 [2025-03-03 15:08:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,573 INFO L471 AbstractCegarLoop]: Abstraction has 34377 states and 47513 transitions. [2025-03-03 15:08:21,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34377 states and 47513 transitions. [2025-03-03 15:08:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:08:21,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:21,577 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1705111595, now seen corresponding path program 1 times [2025-03-03 15:08:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020845960] [2025-03-03 15:08:21,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:08:21,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:08:21,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020845960] [2025-03-03 15:08:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020845960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571450771] [2025-03-03 15:08:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:21,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:21,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:21,985 INFO L87 Difference]: Start difference. First operand 34377 states and 47513 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,620 INFO L93 Difference]: Finished difference Result 111547 states and 154272 transitions. [2025-03-03 15:08:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:08:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:08:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,755 INFO L225 Difference]: With dead ends: 111547 [2025-03-03 15:08:22,755 INFO L226 Difference]: Without dead ends: 105402 [2025-03-03 15:08:22,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:22,794 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 2074 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2074 Valid, 2177 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105402 states. [2025-03-03 15:08:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105402 to 33286. [2025-03-03 15:08:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33286 states, 33285 states have (on average 1.3833258224425418) internal successors, (46044), 33285 states have internal predecessors, (46044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33286 states to 33286 states and 46044 transitions. [2025-03-03 15:08:23,493 INFO L78 Accepts]: Start accepts. Automaton has 33286 states and 46044 transitions. Word has length 82 [2025-03-03 15:08:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 33286 states and 46044 transitions. [2025-03-03 15:08:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 33286 states and 46044 transitions. [2025-03-03 15:08:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:08:23,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:23,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:23,501 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1895459015, now seen corresponding path program 1 times [2025-03-03 15:08:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469246489] [2025-03-03 15:08:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:23,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:08:23,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:08:23,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:23,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:23,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469246489] [2025-03-03 15:08:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469246489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493619468] [2025-03-03 15:08:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:23,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:23,555 INFO L87 Difference]: Start difference. First operand 33286 states and 46044 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:23,687 INFO L93 Difference]: Finished difference Result 72031 states and 100325 transitions. [2025-03-03 15:08:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:08:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:23,741 INFO L225 Difference]: With dead ends: 72031 [2025-03-03 15:08:23,741 INFO L226 Difference]: Without dead ends: 51611 [2025-03-03 15:08:23,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:23,764 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 117 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:23,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51611 states. [2025-03-03 15:08:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51611 to 49843. [2025-03-03 15:08:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49843 states, 49842 states have (on average 1.3806829581477469) internal successors, (68816), 49842 states have internal predecessors, (68816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49843 states to 49843 states and 68816 transitions. [2025-03-03 15:08:24,228 INFO L78 Accepts]: Start accepts. Automaton has 49843 states and 68816 transitions. Word has length 90 [2025-03-03 15:08:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:24,229 INFO L471 AbstractCegarLoop]: Abstraction has 49843 states and 68816 transitions. [2025-03-03 15:08:24,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49843 states and 68816 transitions. [2025-03-03 15:08:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:08:24,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:24,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:24,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:24,234 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -766537616, now seen corresponding path program 1 times [2025-03-03 15:08:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268601278] [2025-03-03 15:08:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:24,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:08:24,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:08:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268601278] [2025-03-03 15:08:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268601278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601850459] [2025-03-03 15:08:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:24,313 INFO L87 Difference]: Start difference. First operand 49843 states and 68816 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,698 INFO L93 Difference]: Finished difference Result 102531 states and 141833 transitions. [2025-03-03 15:08:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:24,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:08:24,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,795 INFO L225 Difference]: With dead ends: 102531 [2025-03-03 15:08:24,795 INFO L226 Difference]: Without dead ends: 82003 [2025-03-03 15:08:24,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:24,831 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1549 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 434 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82003 states. [2025-03-03 15:08:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82003 to 50683. [2025-03-03 15:08:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50683 states, 50682 states have (on average 1.3786946055798903) internal successors, (69875), 50682 states have internal predecessors, (69875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50683 states to 50683 states and 69875 transitions. [2025-03-03 15:08:25,560 INFO L78 Accepts]: Start accepts. Automaton has 50683 states and 69875 transitions. Word has length 94 [2025-03-03 15:08:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:25,560 INFO L471 AbstractCegarLoop]: Abstraction has 50683 states and 69875 transitions. [2025-03-03 15:08:25,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 50683 states and 69875 transitions. [2025-03-03 15:08:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:08:25,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:25,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:25,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:25,565 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1311023787, now seen corresponding path program 1 times [2025-03-03 15:08:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55563813] [2025-03-03 15:08:25,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:25,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:08:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:08:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55563813] [2025-03-03 15:08:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55563813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:25,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334326169] [2025-03-03 15:08:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:25,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:25,632 INFO L87 Difference]: Start difference. First operand 50683 states and 69875 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,093 INFO L93 Difference]: Finished difference Result 157711 states and 218867 transitions. [2025-03-03 15:08:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:08:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,237 INFO L225 Difference]: With dead ends: 157711 [2025-03-03 15:08:26,237 INFO L226 Difference]: Without dead ends: 122421 [2025-03-03 15:08:26,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:26,291 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1421 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 415 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 415 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122421 states. [2025-03-03 15:08:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122421 to 71427. [2025-03-03 15:08:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71427 states, 71426 states have (on average 1.393820177526391) internal successors, (99555), 71426 states have internal predecessors, (99555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71427 states to 71427 states and 99555 transitions. [2025-03-03 15:08:27,262 INFO L78 Accepts]: Start accepts. Automaton has 71427 states and 99555 transitions. Word has length 96 [2025-03-03 15:08:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,263 INFO L471 AbstractCegarLoop]: Abstraction has 71427 states and 99555 transitions. [2025-03-03 15:08:27,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 71427 states and 99555 transitions. [2025-03-03 15:08:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:08:27,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:27,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:27,268 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1972379790, now seen corresponding path program 1 times [2025-03-03 15:08:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081217870] [2025-03-03 15:08:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:27,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:08:27,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:08:27,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:27,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081217870] [2025-03-03 15:08:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081217870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113606885] [2025-03-03 15:08:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:27,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:08:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:08:27,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:08:27,338 INFO L87 Difference]: Start difference. First operand 71427 states and 99555 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:28,046 INFO L93 Difference]: Finished difference Result 186087 states and 259434 transitions. [2025-03-03 15:08:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:08:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:08:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:28,252 INFO L225 Difference]: With dead ends: 186087 [2025-03-03 15:08:28,252 INFO L226 Difference]: Without dead ends: 156473 [2025-03-03 15:08:28,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:28,288 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1242 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:28,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 410 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156473 states. [2025-03-03 15:08:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156473 to 103430. [2025-03-03 15:08:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103430 states, 103429 states have (on average 1.3930038963926945) internal successors, (144077), 103429 states have internal predecessors, (144077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103430 states to 103430 states and 144077 transitions. [2025-03-03 15:08:29,859 INFO L78 Accepts]: Start accepts. Automaton has 103430 states and 144077 transitions. Word has length 98 [2025-03-03 15:08:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 103430 states and 144077 transitions. [2025-03-03 15:08:29,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 103430 states and 144077 transitions. [2025-03-03 15:08:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:08:29,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:29,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:08:29,872 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1816409838, now seen corresponding path program 1 times [2025-03-03 15:08:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189115169] [2025-03-03 15:08:29,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:29,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:08:29,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:08:29,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:29,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:08:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:29,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189115169] [2025-03-03 15:08:29,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189115169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:29,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:29,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244325931] [2025-03-03 15:08:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:29,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:29,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:29,927 INFO L87 Difference]: Start difference. First operand 103430 states and 144077 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:30,663 INFO L93 Difference]: Finished difference Result 244974 states and 339279 transitions. [2025-03-03 15:08:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 110 [2025-03-03 15:08:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:30,840 INFO L225 Difference]: With dead ends: 244974 [2025-03-03 15:08:30,840 INFO L226 Difference]: Without dead ends: 142531 [2025-03-03 15:08:30,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:30,892 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 110 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:30,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 465 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142531 states. [2025-03-03 15:08:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142531 to 135288. [2025-03-03 15:08:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135288 states, 135287 states have (on average 1.3736131335605046) internal successors, (185832), 135287 states have internal predecessors, (185832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135288 states to 135288 states and 185832 transitions. [2025-03-03 15:08:32,667 INFO L78 Accepts]: Start accepts. Automaton has 135288 states and 185832 transitions. Word has length 110 [2025-03-03 15:08:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:32,668 INFO L471 AbstractCegarLoop]: Abstraction has 135288 states and 185832 transitions. [2025-03-03 15:08:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 135288 states and 185832 transitions. [2025-03-03 15:08:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:08:32,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:32,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:32,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:08:32,681 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:32,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -151160272, now seen corresponding path program 1 times [2025-03-03 15:08:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467064374] [2025-03-03 15:08:32,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:32,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:08:32,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:08:32,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:32,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:08:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467064374] [2025-03-03 15:08:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467064374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:32,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:32,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386086299] [2025-03-03 15:08:32,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:32,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:32,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:32,739 INFO L87 Difference]: Start difference. First operand 135288 states and 185832 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:33,772 INFO L93 Difference]: Finished difference Result 314386 states and 429460 transitions. [2025-03-03 15:08:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 111 [2025-03-03 15:08:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:33,983 INFO L225 Difference]: With dead ends: 314386 [2025-03-03 15:08:33,983 INFO L226 Difference]: Without dead ends: 180013 [2025-03-03 15:08:34,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:34,033 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 98 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 459 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180013 states. [2025-03-03 15:08:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180013 to 167780. [2025-03-03 15:08:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167780 states, 167779 states have (on average 1.351182209930921) internal successors, (226700), 167779 states have internal predecessors, (226700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167780 states to 167780 states and 226700 transitions. [2025-03-03 15:08:36,255 INFO L78 Accepts]: Start accepts. Automaton has 167780 states and 226700 transitions. Word has length 111 [2025-03-03 15:08:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 167780 states and 226700 transitions. [2025-03-03 15:08:36,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 167780 states and 226700 transitions. [2025-03-03 15:08:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:08:36,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:08:36,264 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1887581704, now seen corresponding path program 1 times [2025-03-03 15:08:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427372139] [2025-03-03 15:08:36,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:08:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:08:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:08:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427372139] [2025-03-03 15:08:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427372139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920234371] [2025-03-03 15:08:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:36,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:36,324 INFO L87 Difference]: Start difference. First operand 167780 states and 226700 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,570 INFO L93 Difference]: Finished difference Result 457710 states and 618215 transitions. [2025-03-03 15:08:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:37,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 112 [2025-03-03 15:08:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,962 INFO L225 Difference]: With dead ends: 457710 [2025-03-03 15:08:37,962 INFO L226 Difference]: Without dead ends: 278795 [2025-03-03 15:08:38,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:38,057 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 87 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:38,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 452 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278795 states. [2025-03-03 15:08:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278795 to 249126. [2025-03-03 15:08:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249126 states, 249125 states have (on average 1.342542900150527) internal successors, (334461), 249125 states have internal predecessors, (334461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249126 states to 249126 states and 334461 transitions. [2025-03-03 15:08:41,559 INFO L78 Accepts]: Start accepts. Automaton has 249126 states and 334461 transitions. Word has length 112 [2025-03-03 15:08:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,560 INFO L471 AbstractCegarLoop]: Abstraction has 249126 states and 334461 transitions. [2025-03-03 15:08:41,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 249126 states and 334461 transitions. [2025-03-03 15:08:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:08:41,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:08:41,570 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1807544904, now seen corresponding path program 1 times [2025-03-03 15:08:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444215780] [2025-03-03 15:08:41,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:41,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:41,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444215780] [2025-03-03 15:08:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444215780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78529104] [2025-03-03 15:08:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:42,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:42,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:08:42,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:42,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 15:08:42,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78529104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:43,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2025-03-03 15:08:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360529830] [2025-03-03 15:08:43,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 15:08:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 15:08:43,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:08:43,515 INFO L87 Difference]: Start difference. First operand 249126 states and 334461 transitions. Second operand has 24 states, 24 states have (on average 12.208333333333334) internal successors, (293), 24 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:47,392 INFO L93 Difference]: Finished difference Result 996883 states and 1332265 transitions. [2025-03-03 15:08:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 15:08:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 12.208333333333334) internal successors, (293), 24 states have internal predecessors, (293), 0 states have call successors, (0), 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 115 [2025-03-03 15:08:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:49,215 INFO L225 Difference]: With dead ends: 996883 [2025-03-03 15:08:49,216 INFO L226 Difference]: Without dead ends: 786604 [2025-03-03 15:08:49,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=744, Invalid=2796, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 15:08:49,303 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 2469 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:49,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 1983 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:08:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786604 states. [2025-03-03 15:08:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786604 to 451972. [2025-03-03 15:08:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451972 states, 451971 states have (on average 1.3427211037876323) internal successors, (606871), 451971 states have internal predecessors, (606871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451972 states to 451972 states and 606871 transitions. [2025-03-03 15:08:57,699 INFO L78 Accepts]: Start accepts. Automaton has 451972 states and 606871 transitions. Word has length 115 [2025-03-03 15:08:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:57,699 INFO L471 AbstractCegarLoop]: Abstraction has 451972 states and 606871 transitions. [2025-03-03 15:08:57,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.208333333333334) internal successors, (293), 24 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 451972 states and 606871 transitions. [2025-03-03 15:08:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:08:57,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:57,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:57,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:08:57,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 15:08:57,915 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2069431625, now seen corresponding path program 1 times [2025-03-03 15:08:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80498453] [2025-03-03 15:08:57,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:57,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:58,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:58,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:58,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:58,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:58,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80498453] [2025-03-03 15:08:58,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80498453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:58,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894209037] [2025-03-03 15:08:58,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:58,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:58,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:58,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:08:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:08:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:08:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:58,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:08:58,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:59,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:09:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894209037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:09:00,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:09:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 30 [2025-03-03 15:09:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929015038] [2025-03-03 15:09:00,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:09:00,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:09:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:00,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:09:00,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:09:00,610 INFO L87 Difference]: Start difference. First operand 451972 states and 606871 transitions. Second operand has 31 states, 31 states have (on average 9.870967741935484) internal successors, (306), 30 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)