./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:35:24,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:35:24,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:35:24,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:35:24,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:35:24,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:35:24,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:35:24,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:35:24,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:35:24,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:35:24,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:35:24,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:35:24,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:35:24,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:35:24,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:35:24,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:35:24,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:35:24,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:35:24,752 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 [2025-02-05 16:35:24,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:35:24,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:35:24,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:35:24,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:35:24,974 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:35:24,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:35:26,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a83c9b30/023a90cabf2a4ce1a26af6046643c49e/FLAGec21962c6 [2025-02-05 16:35:26,418 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:35:26,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:35:26,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a83c9b30/023a90cabf2a4ce1a26af6046643c49e/FLAGec21962c6 [2025-02-05 16:35:26,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a83c9b30/023a90cabf2a4ce1a26af6046643c49e [2025-02-05 16:35:26,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:35:26,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:35:26,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:26,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:35:26,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:35:26,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:26" (1/1) ... [2025-02-05 16:35:26,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:26, skipping insertion in model container [2025-02-05 16:35:26,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:26" (1/1) ... [2025-02-05 16:35:26,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:35:26,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-02-05 16:35:26,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:26,957 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:35:27,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-02-05 16:35:27,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:27,068 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:35:27,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27 WrapperNode [2025-02-05 16:35:27,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:27,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:27,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:35:27,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:35:27,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,118 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 721 [2025-02-05 16:35:27,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:27,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:35:27,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:35:27,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:35:27,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,146 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:35:27,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:35:27,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:35:27,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:35:27,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:35:27,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (1/1) ... [2025-02-05 16:35:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:35:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:35:27,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:35:27,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:35:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:35:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:35:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:35:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:35:27,328 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:35:27,329 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:27,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node2__m2~2#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node3__m3~2#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node4__m4~2#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:27,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:35:27,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:27,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:27,863 INFO L1309 $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-02-05 16:35:27,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:27,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:27,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:27,896 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 16:35:27,897 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:35:27,910 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:35:27,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:35:27,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:27 BoogieIcfgContainer [2025-02-05 16:35:27,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:35:27,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:35:27,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:35:27,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:35:27,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:35:26" (1/3) ... [2025-02-05 16:35:27,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dd6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:27, skipping insertion in model container [2025-02-05 16:35:27,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:27" (2/3) ... [2025-02-05 16:35:27,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601dd6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:27, skipping insertion in model container [2025-02-05 16:35:27,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:27" (3/3) ... [2025-02-05 16:35:27,918 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:35:27,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:35:27,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 179 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:35:27,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:35:27,997 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;@481cdd1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:35:27,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:35:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:35:28,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:28,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:28,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:28,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1118971602, now seen corresponding path program 1 times [2025-02-05 16:35:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-02-05 16:35:28,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:28,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:35:28,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:35:28,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-02-05 16:35:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113028275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42491079] [2025-02-05 16:35:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:28,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:28,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:28,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:28,583 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 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.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-02-05 16:35:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:28,763 INFO L93 Difference]: Finished difference Result 639 states and 1034 transitions. [2025-02-05 16:35:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:28,766 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-02-05 16:35:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:28,778 INFO L225 Difference]: With dead ends: 639 [2025-02-05 16:35:28,778 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 16:35:28,781 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-02-05 16:35:28,782 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1458 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1827 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-02-05 16:35:28,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1827 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 16:35:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 274. [2025-02-05 16:35:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 413 transitions. [2025-02-05 16:35:28,826 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 413 transitions. Word has length 64 [2025-02-05 16:35:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:28,827 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 413 transitions. [2025-02-05 16:35:28,827 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-02-05 16:35:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 413 transitions. [2025-02-05 16:35:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:28,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:28,829 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-02-05 16:35:28,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:35:28,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 329342078, now seen corresponding path program 1 times [2025-02-05 16:35:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92905914] [2025-02-05 16:35:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:28,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:28,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92905914] [2025-02-05 16:35:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92905914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:29,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79914206] [2025-02-05 16:35:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:29,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:29,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:29,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:29,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:29,098 INFO L87 Difference]: Start difference. First operand 274 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-02-05 16:35:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:29,235 INFO L93 Difference]: Finished difference Result 1012 states and 1565 transitions. [2025-02-05 16:35:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-02-05 16:35:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:29,238 INFO L225 Difference]: With dead ends: 1012 [2025-02-05 16:35:29,239 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 16:35:29,239 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-02-05 16:35:29,241 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1343 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:29,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 747 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 16:35:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2025-02-05 16:35:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1218 transitions. [2025-02-05 16:35:29,276 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1218 transitions. Word has length 65 [2025-02-05 16:35:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1218 transitions. [2025-02-05 16:35:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-02-05 16:35:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1218 transitions. [2025-02-05 16:35:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:29,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:29,280 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-02-05 16:35:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:35:29,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:29,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1214440177, now seen corresponding path program 1 times [2025-02-05 16:35:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-02-05 16:35:29,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:29,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-02-05 16:35:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216247288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:29,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:29,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101805830] [2025-02-05 16:35:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:29,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:29,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:29,466 INFO L87 Difference]: Start difference. First operand 794 states and 1218 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-02-05 16:35:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:29,661 INFO L93 Difference]: Finished difference Result 2016 states and 3140 transitions. [2025-02-05 16:35:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:29,662 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-02-05 16:35:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:29,667 INFO L225 Difference]: With dead ends: 2016 [2025-02-05 16:35:29,667 INFO L226 Difference]: Without dead ends: 1322 [2025-02-05 16:35:29,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:29,670 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 933 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:29,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 252 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-02-05 16:35:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-02-05 16:35:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5466262319939348) internal successors, (2040), 1319 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2040 transitions. [2025-02-05 16:35:29,700 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2040 transitions. Word has length 66 [2025-02-05 16:35:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:29,700 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2040 transitions. [2025-02-05 16:35:29,701 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-02-05 16:35:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2040 transitions. [2025-02-05 16:35:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:29,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:29,702 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-02-05 16:35:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:35:29,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 186148253, now seen corresponding path program 1 times [2025-02-05 16:35:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-02-05 16:35:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:29,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:29,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-02-05 16:35:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725616325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:29,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:29,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649183805] [2025-02-05 16:35:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:29,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:29,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:29,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:29,873 INFO L87 Difference]: Start difference. First operand 1320 states and 2040 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-02-05 16:35:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:30,067 INFO L93 Difference]: Finished difference Result 3647 states and 5687 transitions. [2025-02-05 16:35:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:30,067 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-02-05 16:35:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:30,075 INFO L225 Difference]: With dead ends: 3647 [2025-02-05 16:35:30,075 INFO L226 Difference]: Without dead ends: 2400 [2025-02-05 16:35:30,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:30,078 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 959 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:30,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 250 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2025-02-05 16:35:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2398. [2025-02-05 16:35:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2397 states have (on average 1.5502711722987068) internal successors, (3716), 2397 states have internal predecessors, (3716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3716 transitions. [2025-02-05 16:35:30,139 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3716 transitions. Word has length 66 [2025-02-05 16:35:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:30,140 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3716 transitions. [2025-02-05 16:35:30,140 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-02-05 16:35:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3716 transitions. [2025-02-05 16:35:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:30,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:30,143 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-02-05 16:35:30,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:35:30,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:30,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1665879479, now seen corresponding path program 1 times [2025-02-05 16:35:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-02-05 16:35:30,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:30,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:30,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:30,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-02-05 16:35:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697323397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:30,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:30,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186441246] [2025-02-05 16:35:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:30,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:30,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:30,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:30,264 INFO L87 Difference]: Start difference. First operand 2398 states and 3716 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-02-05 16:35:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:30,459 INFO L93 Difference]: Finished difference Result 6924 states and 10788 transitions. [2025-02-05 16:35:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:30,459 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-02-05 16:35:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:30,473 INFO L225 Difference]: With dead ends: 6924 [2025-02-05 16:35:30,473 INFO L226 Difference]: Without dead ends: 4576 [2025-02-05 16:35:30,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:30,480 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 985 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:30,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-02-05 16:35:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2025-02-05 16:35:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 7081 transitions. [2025-02-05 16:35:30,571 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 7081 transitions. Word has length 66 [2025-02-05 16:35:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:30,571 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 7081 transitions. [2025-02-05 16:35:30,571 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-02-05 16:35:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 7081 transitions. [2025-02-05 16:35:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:30,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:30,572 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-02-05 16:35:30,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:35:30,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash 952289525, now seen corresponding path program 1 times [2025-02-05 16:35:30,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:30,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489306147] [2025-02-05 16:35:30,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:30,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:30,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489306147] [2025-02-05 16:35:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489306147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277638221] [2025-02-05 16:35:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:30,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:30,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:30,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:30,714 INFO L87 Difference]: Start difference. First operand 4574 states and 7081 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-02-05 16:35:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:30,943 INFO L93 Difference]: Finished difference Result 12540 states and 19466 transitions. [2025-02-05 16:35:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:30,944 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-02-05 16:35:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:30,968 INFO L225 Difference]: With dead ends: 12540 [2025-02-05 16:35:30,968 INFO L226 Difference]: Without dead ends: 8000 [2025-02-05 16:35:30,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:30,977 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1011 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:30,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 246 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2025-02-05 16:35:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 7998. [2025-02-05 16:35:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 1.5390771539327248) internal successors, (12308), 7997 states have internal predecessors, (12308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 12308 transitions. [2025-02-05 16:35:31,135 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 12308 transitions. Word has length 66 [2025-02-05 16:35:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 7998 states and 12308 transitions. [2025-02-05 16:35:31,135 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-02-05 16:35:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 12308 transitions. [2025-02-05 16:35:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:31,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,140 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-02-05 16:35:31,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:35:31,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash 146376352, now seen corresponding path program 1 times [2025-02-05 16:35:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-02-05 16:35:31,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:31,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:31,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-02-05 16:35:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279596153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:35:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584456546] [2025-02-05 16:35:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:31,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:31,455 INFO L87 Difference]: Start difference. First operand 7998 states and 12308 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-02-05 16:35:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:31,490 INFO L93 Difference]: Finished difference Result 8224 states and 12645 transitions. [2025-02-05 16:35:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-02-05 16:35:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:31,513 INFO L225 Difference]: With dead ends: 8224 [2025-02-05 16:35:31,513 INFO L226 Difference]: Without dead ends: 8222 [2025-02-05 16:35:31,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:31,517 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 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-02-05 16:35:31,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2025-02-05 16:35:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 8222. [2025-02-05 16:35:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.5243887604914244) internal successors, (12532), 8221 states have internal predecessors, (12532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 12532 transitions. [2025-02-05 16:35:31,635 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 12532 transitions. Word has length 67 [2025-02-05 16:35:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 12532 transitions. [2025-02-05 16:35:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-02-05 16:35:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 12532 transitions. [2025-02-05 16:35:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,637 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-02-05 16:35:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:35:31,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 247473648, now seen corresponding path program 1 times [2025-02-05 16:35:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906995522] [2025-02-05 16:35:31,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:31,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906995522] [2025-02-05 16:35:31,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906995522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861783287] [2025-02-05 16:35:31,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:31,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:31,986 INFO L87 Difference]: Start difference. First operand 8222 states and 12532 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-02-05 16:35:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:32,488 INFO L93 Difference]: Finished difference Result 10931 states and 16524 transitions. [2025-02-05 16:35:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:32,488 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-02-05 16:35:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:32,507 INFO L225 Difference]: With dead ends: 10931 [2025-02-05 16:35:32,507 INFO L226 Difference]: Without dead ends: 9639 [2025-02-05 16:35:32,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:35:32,514 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1372 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:32,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 755 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2025-02-05 16:35:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8222. [2025-02-05 16:35:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.5242671207882252) internal successors, (12531), 8221 states have internal predecessors, (12531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 12531 transitions. [2025-02-05 16:35:32,634 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 12531 transitions. Word has length 68 [2025-02-05 16:35:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:32,635 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 12531 transitions. [2025-02-05 16:35:32,635 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-02-05 16:35:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 12531 transitions. [2025-02-05 16:35:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:32,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:32,637 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-02-05 16:35:32,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:35:32,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:32,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2107380080, now seen corresponding path program 1 times [2025-02-05 16:35:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998900072] [2025-02-05 16:35:32,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:32,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:32,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:32,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998900072] [2025-02-05 16:35:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998900072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:32,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485747441] [2025-02-05 16:35:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:32,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:32,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:32,940 INFO L87 Difference]: Start difference. First operand 8222 states and 12531 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-02-05 16:35:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:33,446 INFO L93 Difference]: Finished difference Result 14703 states and 22225 transitions. [2025-02-05 16:35:33,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:33,446 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-02-05 16:35:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:33,465 INFO L225 Difference]: With dead ends: 14703 [2025-02-05 16:35:33,465 INFO L226 Difference]: Without dead ends: 11126 [2025-02-05 16:35:33,472 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-02-05 16:35:33,473 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1545 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:33,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 796 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11126 states. [2025-02-05 16:35:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11126 to 8390. [2025-02-05 16:35:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8389 states have (on average 1.5212778638693527) internal successors, (12762), 8389 states have internal predecessors, (12762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 12762 transitions. [2025-02-05 16:35:33,602 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 12762 transitions. Word has length 68 [2025-02-05 16:35:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 8390 states and 12762 transitions. [2025-02-05 16:35:33,602 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-02-05 16:35:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 12762 transitions. [2025-02-05 16:35:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:33,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:33,605 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-02-05 16:35:33,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:35:33,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -40485648, now seen corresponding path program 1 times [2025-02-05 16:35:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813516165] [2025-02-05 16:35:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:33,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:33,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:33,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813516165] [2025-02-05 16:35:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813516165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345730505] [2025-02-05 16:35:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:33,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:33,938 INFO L87 Difference]: Start difference. First operand 8390 states and 12762 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-02-05 16:35:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:34,520 INFO L93 Difference]: Finished difference Result 18375 states and 27743 transitions. [2025-02-05 16:35:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:34,521 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-02-05 16:35:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:34,542 INFO L225 Difference]: With dead ends: 18375 [2025-02-05 16:35:34,543 INFO L226 Difference]: Without dead ends: 12535 [2025-02-05 16:35:34,551 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-02-05 16:35:34,552 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1459 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:34,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 846 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:35:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2025-02-05 16:35:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 8578. [2025-02-05 16:35:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8578 states, 8577 states have (on average 1.516147837239128) internal successors, (13004), 8577 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 13004 transitions. [2025-02-05 16:35:34,675 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 13004 transitions. Word has length 68 [2025-02-05 16:35:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 8578 states and 13004 transitions. [2025-02-05 16:35:34,675 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-02-05 16:35:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 13004 transitions. [2025-02-05 16:35:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:34,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:34,678 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-02-05 16:35:34,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:35:34,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:34,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1435412592, now seen corresponding path program 1 times [2025-02-05 16:35:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873385485] [2025-02-05 16:35:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:34,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:34,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:34,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873385485] [2025-02-05 16:35:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873385485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:34,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:35:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60190522] [2025-02-05 16:35:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:35:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:34,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:35:34,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:35:34,960 INFO L87 Difference]: Start difference. First operand 8578 states and 13004 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-02-05 16:35:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:35,649 INFO L93 Difference]: Finished difference Result 21670 states and 32663 transitions. [2025-02-05 16:35:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:35,649 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-02-05 16:35:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:35,677 INFO L225 Difference]: With dead ends: 21670 [2025-02-05 16:35:35,677 INFO L226 Difference]: Without dead ends: 13755 [2025-02-05 16:35:35,688 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-02-05 16:35:35,689 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1072 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:35,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1360 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13755 states. [2025-02-05 16:35:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13755 to 8728. [2025-02-05 16:35:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8728 states, 8727 states have (on average 1.5092242465910393) internal successors, (13171), 8727 states have internal predecessors, (13171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8728 states to 8728 states and 13171 transitions. [2025-02-05 16:35:35,817 INFO L78 Accepts]: Start accepts. Automaton has 8728 states and 13171 transitions. Word has length 68 [2025-02-05 16:35:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:35,818 INFO L471 AbstractCegarLoop]: Abstraction has 8728 states and 13171 transitions. [2025-02-05 16:35:35,818 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-02-05 16:35:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8728 states and 13171 transitions. [2025-02-05 16:35:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:35,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:35,820 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-02-05 16:35:35,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:35:35,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:35,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1592237472, now seen corresponding path program 1 times [2025-02-05 16:35:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65335456] [2025-02-05 16:35:35,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:35,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:35,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:35,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65335456] [2025-02-05 16:35:35,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65335456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:35,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:35,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062944905] [2025-02-05 16:35:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:35,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:35:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:35,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:35:35,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:35:35,956 INFO L87 Difference]: Start difference. First operand 8728 states and 13171 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:36,008 INFO L93 Difference]: Finished difference Result 22788 states and 34565 transitions. [2025-02-05 16:35:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:36,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-02-05 16:35:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:36,026 INFO L225 Difference]: With dead ends: 22788 [2025-02-05 16:35:36,026 INFO L226 Difference]: Without dead ends: 15138 [2025-02-05 16:35:36,036 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-02-05 16:35:36,036 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 170 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 605 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-02-05 16:35:36,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 605 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-02-05 16:35:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15032. [2025-02-05 16:35:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15032 states, 15031 states have (on average 1.4989687978178432) internal successors, (22531), 15031 states have internal predecessors, (22531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 22531 transitions. [2025-02-05 16:35:36,187 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 22531 transitions. Word has length 69 [2025-02-05 16:35:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:36,187 INFO L471 AbstractCegarLoop]: Abstraction has 15032 states and 22531 transitions. [2025-02-05 16:35:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 22531 transitions. [2025-02-05 16:35:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:36,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:36,190 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-02-05 16:35:36,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:35:36,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:36,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash 800567042, now seen corresponding path program 1 times [2025-02-05 16:35:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041435288] [2025-02-05 16:35:36,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:36,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:36,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:36,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:36,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041435288] [2025-02-05 16:35:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041435288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:36,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932072561] [2025-02-05 16:35:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:36,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:36,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:36,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:36,229 INFO L87 Difference]: Start difference. First operand 15032 states and 22531 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-02-05 16:35:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:36,294 INFO L93 Difference]: Finished difference Result 32638 states and 49093 transitions. [2025-02-05 16:35:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:36,294 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-02-05 16:35:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:36,320 INFO L225 Difference]: With dead ends: 32638 [2025-02-05 16:35:36,320 INFO L226 Difference]: Without dead ends: 20054 [2025-02-05 16:35:36,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:36,334 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 176 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 466 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-02-05 16:35:36,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 466 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20054 states. [2025-02-05 16:35:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20054 to 20004. [2025-02-05 16:35:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20004 states, 20003 states have (on average 1.4869769534569814) internal successors, (29744), 20003 states have internal predecessors, (29744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20004 states to 20004 states and 29744 transitions. [2025-02-05 16:35:36,569 INFO L78 Accepts]: Start accepts. Automaton has 20004 states and 29744 transitions. Word has length 69 [2025-02-05 16:35:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:36,569 INFO L471 AbstractCegarLoop]: Abstraction has 20004 states and 29744 transitions. [2025-02-05 16:35:36,569 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-02-05 16:35:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20004 states and 29744 transitions. [2025-02-05 16:35:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:36,572 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-02-05 16:35:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:35:36,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1759014655, now seen corresponding path program 1 times [2025-02-05 16:35:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-02-05 16:35:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:36,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:36,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-02-05 16:35:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509225115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630736858] [2025-02-05 16:35:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:36,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:36,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:36,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:36,611 INFO L87 Difference]: Start difference. First operand 20004 states and 29744 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-02-05 16:35:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:36,676 INFO L93 Difference]: Finished difference Result 29047 states and 43114 transitions. [2025-02-05 16:35:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:36,676 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-02-05 16:35:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:36,703 INFO L225 Difference]: With dead ends: 29047 [2025-02-05 16:35:36,703 INFO L226 Difference]: Without dead ends: 22329 [2025-02-05 16:35:36,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:36,715 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 144 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 556 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-02-05 16:35:36,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 556 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22329 states. [2025-02-05 16:35:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22329 to 19443. [2025-02-05 16:35:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19443 states, 19442 states have (on average 1.4613722868017693) internal successors, (28412), 19442 states have internal predecessors, (28412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 28412 transitions. [2025-02-05 16:35:36,989 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 28412 transitions. Word has length 69 [2025-02-05 16:35:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 19443 states and 28412 transitions. [2025-02-05 16:35:36,990 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-02-05 16:35:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 28412 transitions. [2025-02-05 16:35:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:36,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:36,993 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-02-05 16:35:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:35:36,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:36,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash 706108514, now seen corresponding path program 1 times [2025-02-05 16:35:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330104753] [2025-02-05 16:35:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:37,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:37,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:37,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330104753] [2025-02-05 16:35:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330104753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256353170] [2025-02-05 16:35:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:37,041 INFO L87 Difference]: Start difference. First operand 19443 states and 28412 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-02-05 16:35:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:37,132 INFO L93 Difference]: Finished difference Result 34467 states and 50436 transitions. [2025-02-05 16:35:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:37,133 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-02-05 16:35:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:37,163 INFO L225 Difference]: With dead ends: 34467 [2025-02-05 16:35:37,163 INFO L226 Difference]: Without dead ends: 22527 [2025-02-05 16:35:37,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:37,178 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 154 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 498 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-02-05 16:35:37,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 498 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2025-02-05 16:35:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 22225. [2025-02-05 16:35:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22225 states, 22224 states have (on average 1.4353401727861772) internal successors, (31899), 22224 states have internal predecessors, (31899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 31899 transitions. [2025-02-05 16:35:37,444 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 31899 transitions. Word has length 69 [2025-02-05 16:35:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:37,444 INFO L471 AbstractCegarLoop]: Abstraction has 22225 states and 31899 transitions. [2025-02-05 16:35:37,444 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-02-05 16:35:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 31899 transitions. [2025-02-05 16:35:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:37,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:37,447 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-02-05 16:35:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:35:37,447 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 871916129, now seen corresponding path program 1 times [2025-02-05 16:35:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417685394] [2025-02-05 16:35:37,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:37,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:37,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:37,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:37,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417685394] [2025-02-05 16:35:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417685394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817612621] [2025-02-05 16:35:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:37,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:37,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:37,494 INFO L87 Difference]: Start difference. First operand 22225 states and 31899 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-02-05 16:35:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:37,666 INFO L93 Difference]: Finished difference Result 44870 states and 64241 transitions. [2025-02-05 16:35:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:37,670 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-02-05 16:35:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:37,705 INFO L225 Difference]: With dead ends: 44870 [2025-02-05 16:35:37,706 INFO L226 Difference]: Without dead ends: 25148 [2025-02-05 16:35:37,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:37,720 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 463 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-02-05 16:35:37,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 463 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25148 states. [2025-02-05 16:35:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25148 to 24902. [2025-02-05 16:35:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24902 states, 24901 states have (on average 1.398417734227541) internal successors, (34822), 24901 states have internal predecessors, (34822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24902 states to 24902 states and 34822 transitions. [2025-02-05 16:35:37,969 INFO L78 Accepts]: Start accepts. Automaton has 24902 states and 34822 transitions. Word has length 69 [2025-02-05 16:35:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:37,970 INFO L471 AbstractCegarLoop]: Abstraction has 24902 states and 34822 transitions. [2025-02-05 16:35:37,970 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-02-05 16:35:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24902 states and 34822 transitions. [2025-02-05 16:35:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:37,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:37,972 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-02-05 16:35:37,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:35:37,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:37,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash -548566319, now seen corresponding path program 1 times [2025-02-05 16:35:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859877421] [2025-02-05 16:35:37,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:37,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:37,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:37,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:37,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:38,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859877421] [2025-02-05 16:35:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859877421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:38,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031233670] [2025-02-05 16:35:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:38,057 INFO L87 Difference]: Start difference. First operand 24902 states and 34822 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:38,206 INFO L93 Difference]: Finished difference Result 46031 states and 64885 transitions. [2025-02-05 16:35:38,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:38,207 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-02-05 16:35:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:38,407 INFO L225 Difference]: With dead ends: 46031 [2025-02-05 16:35:38,407 INFO L226 Difference]: Without dead ends: 43041 [2025-02-05 16:35:38,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:38,413 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1111 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1126 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-02-05 16:35:38,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1126 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43041 states. [2025-02-05 16:35:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43041 to 27845. [2025-02-05 16:35:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27845 states, 27844 states have (on average 1.398972848728631) internal successors, (38953), 27844 states have internal predecessors, (38953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27845 states to 27845 states and 38953 transitions. [2025-02-05 16:35:38,736 INFO L78 Accepts]: Start accepts. Automaton has 27845 states and 38953 transitions. Word has length 70 [2025-02-05 16:35:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:38,737 INFO L471 AbstractCegarLoop]: Abstraction has 27845 states and 38953 transitions. [2025-02-05 16:35:38,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27845 states and 38953 transitions. [2025-02-05 16:35:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:38,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:38,739 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-02-05 16:35:38,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:35:38,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:38,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash -271879983, now seen corresponding path program 1 times [2025-02-05 16:35:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:38,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-02-05 16:35:38,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:38,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-02-05 16:35:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466836275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734726283] [2025-02-05 16:35:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:38,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:38,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:38,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:38,827 INFO L87 Difference]: Start difference. First operand 27845 states and 38953 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:39,147 INFO L93 Difference]: Finished difference Result 52522 states and 74052 transitions. [2025-02-05 16:35:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:39,147 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-02-05 16:35:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:39,214 INFO L225 Difference]: With dead ends: 52522 [2025-02-05 16:35:39,214 INFO L226 Difference]: Without dead ends: 45908 [2025-02-05 16:35:39,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:39,225 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1035 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1190 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-02-05 16:35:39,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45908 states. [2025-02-05 16:35:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45908 to 34374. [2025-02-05 16:35:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34374 states, 34373 states have (on average 1.3991214034271084) internal successors, (48092), 34373 states have internal predecessors, (48092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34374 states to 34374 states and 48092 transitions. [2025-02-05 16:35:39,629 INFO L78 Accepts]: Start accepts. Automaton has 34374 states and 48092 transitions. Word has length 70 [2025-02-05 16:35:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:39,629 INFO L471 AbstractCegarLoop]: Abstraction has 34374 states and 48092 transitions. [2025-02-05 16:35:39,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34374 states and 48092 transitions. [2025-02-05 16:35:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:39,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:39,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:39,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:35:39,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:39,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1385153455, now seen corresponding path program 1 times [2025-02-05 16:35:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:39,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545233329] [2025-02-05 16:35:39,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:39,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:39,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:39,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:39,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:39,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:39,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545233329] [2025-02-05 16:35:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545233329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650466537] [2025-02-05 16:35:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:39,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:39,789 INFO L87 Difference]: Start difference. First operand 34374 states and 48092 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:40,011 INFO L93 Difference]: Finished difference Result 62447 states and 88025 transitions. [2025-02-05 16:35:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:40,012 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-02-05 16:35:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:40,090 INFO L225 Difference]: With dead ends: 62447 [2025-02-05 16:35:40,091 INFO L226 Difference]: Without dead ends: 52353 [2025-02-05 16:35:40,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:40,115 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1080 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1279 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:40,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1279 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52353 states. [2025-02-05 16:35:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52353 to 41438. [2025-02-05 16:35:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41438 states, 41437 states have (on average 1.401187344643676) internal successors, (58061), 41437 states have internal predecessors, (58061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41438 states to 41438 states and 58061 transitions. [2025-02-05 16:35:40,783 INFO L78 Accepts]: Start accepts. Automaton has 41438 states and 58061 transitions. Word has length 70 [2025-02-05 16:35:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:40,783 INFO L471 AbstractCegarLoop]: Abstraction has 41438 states and 58061 transitions. [2025-02-05 16:35:40,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 41438 states and 58061 transitions. [2025-02-05 16:35:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:40,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:40,786 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-02-05 16:35:40,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:35:40,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:40,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2089966831, now seen corresponding path program 1 times [2025-02-05 16:35:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-02-05 16:35:40,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:40,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:40,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:40,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-02-05 16:35:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314364760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:40,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896007954] [2025-02-05 16:35:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:40,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:40,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:40,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:40,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:40,879 INFO L87 Difference]: Start difference. First operand 41438 states and 58061 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:41,131 INFO L93 Difference]: Finished difference Result 71179 states and 100265 transitions. [2025-02-05 16:35:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:41,131 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-02-05 16:35:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:41,217 INFO L225 Difference]: With dead ends: 71179 [2025-02-05 16:35:41,218 INFO L226 Difference]: Without dead ends: 60738 [2025-02-05 16:35:41,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:41,248 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1089 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:41,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1142 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60738 states. [2025-02-05 16:35:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60738 to 45936. [2025-02-05 16:35:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.4016327419179275) internal successors, (64384), 45935 states have internal predecessors, (64384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 64384 transitions. [2025-02-05 16:35:41,920 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 64384 transitions. Word has length 70 [2025-02-05 16:35:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:41,920 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 64384 transitions. [2025-02-05 16:35:41,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 64384 transitions. [2025-02-05 16:35:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:41,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:41,923 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-02-05 16:35:41,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:35:41,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 646420641, now seen corresponding path program 1 times [2025-02-05 16:35:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656073677] [2025-02-05 16:35:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:41,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:41,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656073677] [2025-02-05 16:35:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656073677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:42,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:42,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983645344] [2025-02-05 16:35:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:42,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:42,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:42,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:42,008 INFO L87 Difference]: Start difference. First operand 45936 states and 64384 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-02-05 16:35:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:42,778 INFO L93 Difference]: Finished difference Result 135931 states and 189048 transitions. [2025-02-05 16:35:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:42,779 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-02-05 16:35:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:42,913 INFO L225 Difference]: With dead ends: 135931 [2025-02-05 16:35:42,914 INFO L226 Difference]: Without dead ends: 118901 [2025-02-05 16:35:42,939 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-02-05 16:35:42,940 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1608 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:42,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 457 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118901 states. [2025-02-05 16:35:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118901 to 46098. [2025-02-05 16:35:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46098 states, 46097 states have (on average 1.4008937674902922) internal successors, (64577), 46097 states have internal predecessors, (64577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46098 states to 46098 states and 64577 transitions. [2025-02-05 16:35:43,964 INFO L78 Accepts]: Start accepts. Automaton has 46098 states and 64577 transitions. Word has length 75 [2025-02-05 16:35:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:43,964 INFO L471 AbstractCegarLoop]: Abstraction has 46098 states and 64577 transitions. [2025-02-05 16:35:43,965 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-02-05 16:35:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 46098 states and 64577 transitions. [2025-02-05 16:35:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:43,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:43,968 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-02-05 16:35:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:35:43,969 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1669357284, now seen corresponding path program 1 times [2025-02-05 16:35:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863169307] [2025-02-05 16:35:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:43,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:43,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:43,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:43,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863169307] [2025-02-05 16:35:44,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863169307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:44,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043878590] [2025-02-05 16:35:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:44,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:44,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:44,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:44,073 INFO L87 Difference]: Start difference. First operand 46098 states and 64577 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-02-05 16:35:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:44,749 INFO L93 Difference]: Finished difference Result 143943 states and 201252 transitions. [2025-02-05 16:35:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:44,752 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-02-05 16:35:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:44,915 INFO L225 Difference]: With dead ends: 143943 [2025-02-05 16:35:44,915 INFO L226 Difference]: Without dead ends: 121485 [2025-02-05 16:35:44,960 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-02-05 16:35:44,961 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1766 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:44,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 470 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121485 states. [2025-02-05 16:35:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121485 to 46202. [2025-02-05 16:35:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46202 states, 46201 states have (on average 1.400445877794853) internal successors, (64702), 46201 states have internal predecessors, (64702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46202 states to 46202 states and 64702 transitions. [2025-02-05 16:35:45,896 INFO L78 Accepts]: Start accepts. Automaton has 46202 states and 64702 transitions. Word has length 75 [2025-02-05 16:35:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 46202 states and 64702 transitions. [2025-02-05 16:35:45,896 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-02-05 16:35:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46202 states and 64702 transitions. [2025-02-05 16:35:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:45,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:45,900 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-02-05 16:35:45,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:35:45,900 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:45,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1099371106, now seen corresponding path program 1 times [2025-02-05 16:35:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-02-05 16:35:45,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:45,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:45,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:45,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-02-05 16:35:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541777626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898856500] [2025-02-05 16:35:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:45,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:45,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:45,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:45,979 INFO L87 Difference]: Start difference. First operand 46202 states and 64702 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-02-05 16:35:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:46,584 INFO L93 Difference]: Finished difference Result 108667 states and 150683 transitions. [2025-02-05 16:35:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:46,584 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-02-05 16:35:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:46,692 INFO L225 Difference]: With dead ends: 108667 [2025-02-05 16:35:46,692 INFO L226 Difference]: Without dead ends: 99869 [2025-02-05 16:35:46,716 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-02-05 16:35:46,717 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1394 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:46,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 449 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99869 states. [2025-02-05 16:35:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99869 to 46451. [2025-02-05 16:35:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46451 states, 46450 states have (on average 1.3991819160387513) internal successors, (64992), 46450 states have internal predecessors, (64992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46451 states to 46451 states and 64992 transitions. [2025-02-05 16:35:47,833 INFO L78 Accepts]: Start accepts. Automaton has 46451 states and 64992 transitions. Word has length 75 [2025-02-05 16:35:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:47,833 INFO L471 AbstractCegarLoop]: Abstraction has 46451 states and 64992 transitions. [2025-02-05 16:35:47,833 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-02-05 16:35:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 46451 states and 64992 transitions. [2025-02-05 16:35:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:35:47,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:47,837 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-02-05 16:35:47,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:35:47,837 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:47,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 152121571, now seen corresponding path program 1 times [2025-02-05 16:35:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502678312] [2025-02-05 16:35:47,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:47,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:35:47,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:35:47,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502678312] [2025-02-05 16:35:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502678312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756702725] [2025-02-05 16:35:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:47,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:47,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:47,906 INFO L87 Difference]: Start difference. First operand 46451 states and 64992 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-02-05 16:35:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:48,353 INFO L93 Difference]: Finished difference Result 114627 states and 159607 transitions. [2025-02-05 16:35:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:48,354 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-02-05 16:35:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:48,464 INFO L225 Difference]: With dead ends: 114627 [2025-02-05 16:35:48,464 INFO L226 Difference]: Without dead ends: 87399 [2025-02-05 16:35:48,506 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-02-05 16:35:48,506 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1229 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:48,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 403 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87399 states. [2025-02-05 16:35:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87399 to 46501. [2025-02-05 16:35:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46501 states, 46500 states have (on average 1.3989677419354838) internal successors, (65052), 46500 states have internal predecessors, (65052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46501 states to 46501 states and 65052 transitions. [2025-02-05 16:35:49,341 INFO L78 Accepts]: Start accepts. Automaton has 46501 states and 65052 transitions. Word has length 75 [2025-02-05 16:35:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:49,341 INFO L471 AbstractCegarLoop]: Abstraction has 46501 states and 65052 transitions. [2025-02-05 16:35:49,341 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-02-05 16:35:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46501 states and 65052 transitions. [2025-02-05 16:35:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:49,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:49,346 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-02-05 16:35:49,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:35:49,346 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash -463025853, now seen corresponding path program 1 times [2025-02-05 16:35:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632054777] [2025-02-05 16:35:49,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:49,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:49,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:49,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:49,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:49,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-02-05 16:35:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:49,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632054777] [2025-02-05 16:35:49,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632054777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:49,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938465194] [2025-02-05 16:35:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:49,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:49,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:49,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:49,878 INFO L87 Difference]: Start difference. First operand 46501 states and 65052 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-02-05 16:35:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:50,742 INFO L93 Difference]: Finished difference Result 85372 states and 119461 transitions. [2025-02-05 16:35:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:35:50,743 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-02-05 16:35:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:50,985 INFO L225 Difference]: With dead ends: 85372 [2025-02-05 16:35:50,985 INFO L226 Difference]: Without dead ends: 79430 [2025-02-05 16:35:50,997 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-02-05 16:35:50,998 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1347 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:50,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1957 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79430 states. [2025-02-05 16:35:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79430 to 46514. [2025-02-05 16:35:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46514 states, 46513 states have (on average 1.3987057381807237) internal successors, (65058), 46513 states have internal predecessors, (65058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46514 states to 46514 states and 65058 transitions. [2025-02-05 16:35:51,786 INFO L78 Accepts]: Start accepts. Automaton has 46514 states and 65058 transitions. Word has length 77 [2025-02-05 16:35:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:51,786 INFO L471 AbstractCegarLoop]: Abstraction has 46514 states and 65058 transitions. [2025-02-05 16:35:51,786 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-02-05 16:35:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46514 states and 65058 transitions. [2025-02-05 16:35:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:35:51,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:51,791 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-02-05 16:35:51,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:35:51,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:51,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1194915973, now seen corresponding path program 1 times [2025-02-05 16:35:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316791279] [2025-02-05 16:35:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:51,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:35:51,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:35:51,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316791279] [2025-02-05 16:35:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316791279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:35:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574296740] [2025-02-05 16:35:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:52,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:35:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:52,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:35:52,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:35:52,202 INFO L87 Difference]: Start difference. First operand 46514 states and 65058 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:52,885 INFO L93 Difference]: Finished difference Result 94529 states and 132656 transitions. [2025-02-05 16:35:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:52,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 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-02-05 16:35:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:52,984 INFO L225 Difference]: With dead ends: 94529 [2025-02-05 16:35:52,985 INFO L226 Difference]: Without dead ends: 74900 [2025-02-05 16:35:53,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:35:53,021 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 908 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1837 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:35:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74900 states. [2025-02-05 16:35:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74900 to 46417. [2025-02-05 16:35:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46417 states, 46416 states have (on average 1.3990434332988624) internal successors, (64938), 46416 states have internal predecessors, (64938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46417 states to 46417 states and 64938 transitions. [2025-02-05 16:35:53,944 INFO L78 Accepts]: Start accepts. Automaton has 46417 states and 64938 transitions. Word has length 77 [2025-02-05 16:35:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 46417 states and 64938 transitions. [2025-02-05 16:35:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 46417 states and 64938 transitions. [2025-02-05 16:35:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:35:53,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:53,948 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-02-05 16:35:53,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:35:53,950 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:53,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -164434357, now seen corresponding path program 1 times [2025-02-05 16:35:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-02-05 16:35:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:53,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:35:53,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:35:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-02-05 16:35:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223132194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865345315] [2025-02-05 16:35:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:53,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:53,989 INFO L87 Difference]: Start difference. First operand 46417 states and 64938 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-02-05 16:35:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:54,225 INFO L93 Difference]: Finished difference Result 101603 states and 142436 transitions. [2025-02-05 16:35:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:54,226 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-02-05 16:35:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:54,314 INFO L225 Difference]: With dead ends: 101603 [2025-02-05 16:35:54,314 INFO L226 Difference]: Without dead ends: 73511 [2025-02-05 16:35:54,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:54,355 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 198 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:54,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 394 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73511 states. [2025-02-05 16:35:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73511 to 73365. [2025-02-05 16:35:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73365 states, 73364 states have (on average 1.4010822746851317) internal successors, (102789), 73364 states have internal predecessors, (102789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73365 states to 73365 states and 102789 transitions. [2025-02-05 16:35:55,494 INFO L78 Accepts]: Start accepts. Automaton has 73365 states and 102789 transitions. Word has length 78 [2025-02-05 16:35:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 73365 states and 102789 transitions. [2025-02-05 16:35:55,494 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-02-05 16:35:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 73365 states and 102789 transitions. [2025-02-05 16:35:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:35:55,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:55,500 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-02-05 16:35:55,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:35:55,500 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:55,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1552857261, now seen corresponding path program 1 times [2025-02-05 16:35:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906058863] [2025-02-05 16:35:55,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:55,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:35:55,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:35:55,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906058863] [2025-02-05 16:35:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906058863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355585004] [2025-02-05 16:35:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:55,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:55,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:55,544 INFO L87 Difference]: Start difference. First operand 73365 states and 102789 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-02-05 16:35:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:56,123 INFO L93 Difference]: Finished difference Result 156418 states and 219206 transitions. [2025-02-05 16:35:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:56,123 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-02-05 16:35:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:56,269 INFO L225 Difference]: With dead ends: 156418 [2025-02-05 16:35:56,270 INFO L226 Difference]: Without dead ends: 107402 [2025-02-05 16:35:56,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:56,309 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 184 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 362 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-02-05 16:35:56,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2025-02-05 16:35:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 107020. [2025-02-05 16:35:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107020 states, 107019 states have (on average 1.403890897877947) internal successors, (150243), 107019 states have internal predecessors, (150243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107020 states to 107020 states and 150243 transitions. [2025-02-05 16:35:57,821 INFO L78 Accepts]: Start accepts. Automaton has 107020 states and 150243 transitions. Word has length 78 [2025-02-05 16:35:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:57,821 INFO L471 AbstractCegarLoop]: Abstraction has 107020 states and 150243 transitions. [2025-02-05 16:35:57,821 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-02-05 16:35:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 107020 states and 150243 transitions. [2025-02-05 16:35:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:35:57,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:57,830 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-02-05 16:35:57,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:35:57,831 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:35:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 224140727, now seen corresponding path program 1 times [2025-02-05 16:35:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466281698] [2025-02-05 16:35:57,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:57,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:35:57,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:35:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466281698] [2025-02-05 16:35:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466281698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296086792] [2025-02-05 16:35:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:57,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:57,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:57,862 INFO L87 Difference]: Start difference. First operand 107020 states and 150243 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-02-05 16:35:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:58,695 INFO L93 Difference]: Finished difference Result 209523 states and 294590 transitions. [2025-02-05 16:35:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:58,695 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-02-05 16:35:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:58,907 INFO L225 Difference]: With dead ends: 209523 [2025-02-05 16:35:58,907 INFO L226 Difference]: Without dead ends: 142941 [2025-02-05 16:35:58,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:58,943 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 171 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 360 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-02-05 16:35:58,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 360 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142941 states. [2025-02-05 16:36:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142941 to 91634. [2025-02-05 16:36:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91634 states, 91633 states have (on average 1.4082044678227277) internal successors, (129038), 91633 states have internal predecessors, (129038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91634 states to 91634 states and 129038 transitions. [2025-02-05 16:36:00,761 INFO L78 Accepts]: Start accepts. Automaton has 91634 states and 129038 transitions. Word has length 81 [2025-02-05 16:36:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 91634 states and 129038 transitions. [2025-02-05 16:36:00,761 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-02-05 16:36:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 91634 states and 129038 transitions. [2025-02-05 16:36:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:00,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:00,767 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-02-05 16:36:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:36:00,768 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:00,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash 310655262, now seen corresponding path program 1 times [2025-02-05 16:36:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:00,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869733173] [2025-02-05 16:36:00,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869733173] [2025-02-05 16:36:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869733173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:00,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737277444] [2025-02-05 16:36:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:00,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:00,816 INFO L87 Difference]: Start difference. First operand 91634 states and 129038 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-02-05 16:36:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:01,070 INFO L93 Difference]: Finished difference Result 134823 states and 189389 transitions. [2025-02-05 16:36:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:01,071 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-02-05 16:36:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:01,162 INFO L225 Difference]: With dead ends: 134823 [2025-02-05 16:36:01,162 INFO L226 Difference]: Without dead ends: 80987 [2025-02-05 16:36:01,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:01,209 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 147 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 578 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-02-05 16:36:01,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 578 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80987 states. [2025-02-05 16:36:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80987 to 80985. [2025-02-05 16:36:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80985 states, 80984 states have (on average 1.3926454608317693) internal successors, (112782), 80984 states have internal predecessors, (112782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80985 states to 80985 states and 112782 transitions. [2025-02-05 16:36:02,269 INFO L78 Accepts]: Start accepts. Automaton has 80985 states and 112782 transitions. Word has length 81 [2025-02-05 16:36:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 80985 states and 112782 transitions. [2025-02-05 16:36:02,269 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-02-05 16:36:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 80985 states and 112782 transitions. [2025-02-05 16:36:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:36:02,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:02,275 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-02-05 16:36:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:36:02,275 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1935995021, now seen corresponding path program 1 times [2025-02-05 16:36:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605859357] [2025-02-05 16:36:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:02,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:36:02,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:36:02,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:02,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605859357] [2025-02-05 16:36:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605859357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650522121] [2025-02-05 16:36:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:02,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:02,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:02,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:02,505 INFO L87 Difference]: Start difference. First operand 80985 states and 112782 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:02,977 INFO L93 Difference]: Finished difference Result 159900 states and 222917 transitions. [2025-02-05 16:36:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:36:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:03,145 INFO L225 Difference]: With dead ends: 159900 [2025-02-05 16:36:03,145 INFO L226 Difference]: Without dead ends: 112055 [2025-02-05 16:36:03,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:03,205 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 180 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 364 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-02-05 16:36:03,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 364 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112055 states. [2025-02-05 16:36:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112055 to 78919. [2025-02-05 16:36:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78919 states, 78918 states have (on average 1.390861400440964) internal successors, (109764), 78918 states have internal predecessors, (109764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78919 states to 78919 states and 109764 transitions. [2025-02-05 16:36:04,592 INFO L78 Accepts]: Start accepts. Automaton has 78919 states and 109764 transitions. Word has length 82 [2025-02-05 16:36:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:04,592 INFO L471 AbstractCegarLoop]: Abstraction has 78919 states and 109764 transitions. [2025-02-05 16:36:04,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 78919 states and 109764 transitions. [2025-02-05 16:36:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:36:04,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:04,597 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-02-05 16:36:04,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:36:04,598 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:04,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash -327572470, now seen corresponding path program 1 times [2025-02-05 16:36:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:04,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306628993] [2025-02-05 16:36:04,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:36:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:36:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306628993] [2025-02-05 16:36:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306628993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:36:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819562551] [2025-02-05 16:36:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:05,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:36:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:05,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:36:05,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:36:05,154 INFO L87 Difference]: Start difference. First operand 78919 states and 109764 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-02-05 16:36:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:05,990 INFO L93 Difference]: Finished difference Result 143430 states and 198908 transitions. [2025-02-05 16:36:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:36:05,990 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-02-05 16:36:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:06,171 INFO L225 Difference]: With dead ends: 143430 [2025-02-05 16:36:06,171 INFO L226 Difference]: Without dead ends: 132227 [2025-02-05 16:36:06,218 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-02-05 16:36:06,218 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1843 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:06,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 1951 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132227 states. [2025-02-05 16:36:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132227 to 77822. [2025-02-05 16:36:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77822 states, 77821 states have (on average 1.3915138587270788) internal successors, (108289), 77821 states have internal predecessors, (108289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77822 states to 77822 states and 108289 transitions. [2025-02-05 16:36:07,739 INFO L78 Accepts]: Start accepts. Automaton has 77822 states and 108289 transitions. Word has length 82 [2025-02-05 16:36:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 77822 states and 108289 transitions. [2025-02-05 16:36:07,740 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-02-05 16:36:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 77822 states and 108289 transitions. [2025-02-05 16:36:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:36:07,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:07,753 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, 1] [2025-02-05 16:36:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:36:07,753 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:07,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -822194964, now seen corresponding path program 1 times [2025-02-05 16:36:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-02-05 16:36:07,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:07,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:36:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:36:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:07,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979493005] [2025-02-05 16:36:07,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979493005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:07,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188425543] [2025-02-05 16:36:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:07,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:07,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:07,836 INFO L87 Difference]: Start difference. First operand 77822 states and 108289 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:08,301 INFO L93 Difference]: Finished difference Result 177131 states and 247655 transitions. [2025-02-05 16:36:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:36:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:08,493 INFO L225 Difference]: With dead ends: 177131 [2025-02-05 16:36:08,493 INFO L226 Difference]: Without dead ends: 125064 [2025-02-05 16:36:08,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:08,557 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 125 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:08,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 497 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125064 states. [2025-02-05 16:36:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125064 to 118834. [2025-02-05 16:36:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118834 states, 118833 states have (on average 1.3868201593833362) internal successors, (164800), 118833 states have internal predecessors, (164800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118834 states to 118834 states and 164800 transitions. [2025-02-05 16:36:10,345 INFO L78 Accepts]: Start accepts. Automaton has 118834 states and 164800 transitions. Word has length 91 [2025-02-05 16:36:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:10,345 INFO L471 AbstractCegarLoop]: Abstraction has 118834 states and 164800 transitions. [2025-02-05 16:36:10,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118834 states and 164800 transitions. [2025-02-05 16:36:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:36:10,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:10,355 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-02-05 16:36:10,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:36:10,355 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:10,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1248953632, now seen corresponding path program 1 times [2025-02-05 16:36:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626258291] [2025-02-05 16:36:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:10,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:36:10,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:36:10,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:10,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626258291] [2025-02-05 16:36:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626258291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:36:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678824327] [2025-02-05 16:36:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:10,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:10,435 INFO L87 Difference]: Start difference. First operand 118834 states and 164800 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-02-05 16:36:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:11,577 INFO L93 Difference]: Finished difference Result 238052 states and 330198 transitions. [2025-02-05 16:36:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:36:11,577 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-02-05 16:36:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:11,789 INFO L225 Difference]: With dead ends: 238052 [2025-02-05 16:36:11,790 INFO L226 Difference]: Without dead ends: 189314 [2025-02-05 16:36:11,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:36:11,822 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1605 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:11,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 445 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189314 states. [2025-02-05 16:36:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189314 to 124737. [2025-02-05 16:36:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124737 states, 124736 states have (on average 1.3822072216521293) internal successors, (172411), 124736 states have internal predecessors, (172411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)