./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:03:38,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:03:39,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:03:39,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:03:39,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:03:39,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:03:39,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:03:39,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:03:39,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:03:39,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:03:39,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:03:39,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:03:39,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:03:39,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:03:39,066 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:03:39,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:03:39,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:03:39,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:03:39,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:03:39,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:03:39,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:03:39,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:03:39,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:03:39,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:03:39,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:03:39,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:03:39,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:03:39,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:03:39,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:03:39,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:03:39,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:03:39,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:03:39,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:03:39,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:03:39,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:03:39,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:03:39,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:03:39,074 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 [2024-11-10 00:03:39,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:03:39,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:03:39,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:03:39,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:03:39,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:03:39,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:03:40,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:03:40,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:03:40,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:03:40,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bf52ed3/3d3114e8536c44ec8b131a0bac125899/FLAG2aa8ae2d1 [2024-11-10 00:03:40,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bf52ed3/3d3114e8536c44ec8b131a0bac125899 [2024-11-10 00:03:40,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:03:40,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:03:40,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:03:40,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:03:40,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:03:40,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:40" (1/1) ... [2024-11-10 00:03:40,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@766b768c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:40, skipping insertion in model container [2024-11-10 00:03:40,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:40" (1/1) ... [2024-11-10 00:03:40,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:03:40,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2024-11-10 00:03:40,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:03:40,976 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:03:41,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2024-11-10 00:03:41,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:03:41,065 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:03:41,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41 WrapperNode [2024-11-10 00:03:41,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:03:41,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:03:41,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:03:41,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:03:41,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,118 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 625 [2024-11-10 00:03:41,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:03:41,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:03:41,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:03:41,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:03:41,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,145 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]. [2024-11-10 00:03:41,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:03:41,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:03:41,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:03:41,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:03:41,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (1/1) ... [2024-11-10 00:03:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:03:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:03:41,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:03:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:03:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:03:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:03:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:03:41,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:03:41,335 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:03:41,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:03:41,772 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,772 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~node6____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node7____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,773 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc main_~node7__m7~0#1;havoc main_~node6__m6~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc main_~node7__m7~0#1;havoc main_~node6__m6~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc main_~node7__m7~0#1;havoc main_~node6__m6~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,775 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,776 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:03:41,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:03:41,808 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-10 00:03:41,811 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:03:41,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:03:41,826 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:03:41,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:03:41 BoogieIcfgContainer [2024-11-10 00:03:41,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:03:41,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:03:41,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:03:41,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:03:41,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:03:40" (1/3) ... [2024-11-10 00:03:41,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d30e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:03:41, skipping insertion in model container [2024-11-10 00:03:41,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:41" (2/3) ... [2024-11-10 00:03:41,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d30e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:03:41, skipping insertion in model container [2024-11-10 00:03:41,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:03:41" (3/3) ... [2024-11-10 00:03:41,834 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-10 00:03:41,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:03:41,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:03:41,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:03:41,902 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;@61d2bd7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:03:41,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:03:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.7214285714285715) internal successors, (241), 141 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:03:41,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:41,915 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-10 00:03:41,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 350138721, now seen corresponding path program 1 times [2024-11-10 00:03:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:41,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319446783] [2024-11-10 00:03:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319446783] [2024-11-10 00:03:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319446783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:42,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286823008] [2024-11-10 00:03:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:42,316 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.7214285714285715) internal successors, (241), 141 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:42,375 INFO L93 Difference]: Finished difference Result 310 states and 500 transitions. [2024-11-10 00:03:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 00:03:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:42,388 INFO L225 Difference]: With dead ends: 310 [2024-11-10 00:03:42,389 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 00:03:42,391 INFO L431 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 [2024-11-10 00:03:42,395 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 162 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:42,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 00:03:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2024-11-10 00:03:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4339622641509433) internal successors, (304), 212 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) [2024-11-10 00:03:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 304 transitions. [2024-11-10 00:03:42,445 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 304 transitions. Word has length 87 [2024-11-10 00:03:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 304 transitions. [2024-11-10 00:03:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 304 transitions. [2024-11-10 00:03:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 00:03:42,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:42,450 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:42,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:03:42,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:42,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1793554748, now seen corresponding path program 1 times [2024-11-10 00:03:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:42,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492368072] [2024-11-10 00:03:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:42,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492368072] [2024-11-10 00:03:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492368072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183470583] [2024-11-10 00:03:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:42,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:42,678 INFO L87 Difference]: Start difference. First operand 213 states and 304 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:42,722 INFO L93 Difference]: Finished difference Result 517 states and 780 transitions. [2024-11-10 00:03:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 00:03:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:42,724 INFO L225 Difference]: With dead ends: 517 [2024-11-10 00:03:42,725 INFO L226 Difference]: Without dead ends: 357 [2024-11-10 00:03:42,725 INFO L431 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 [2024-11-10 00:03:42,726 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 113 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:42,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 411 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-10 00:03:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2024-11-10 00:03:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4858757062146892) internal successors, (526), 354 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 526 transitions. [2024-11-10 00:03:42,751 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 526 transitions. Word has length 88 [2024-11-10 00:03:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 526 transitions. [2024-11-10 00:03:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 526 transitions. [2024-11-10 00:03:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:03:42,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:42,756 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:03:42,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1750931823, now seen corresponding path program 1 times [2024-11-10 00:03:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769141140] [2024-11-10 00:03:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769141140] [2024-11-10 00:03:42,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769141140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:42,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168885940] [2024-11-10 00:03:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:42,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:42,895 INFO L87 Difference]: Start difference. First operand 355 states and 526 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:42,920 INFO L93 Difference]: Finished difference Result 927 states and 1420 transitions. [2024-11-10 00:03:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:03:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:42,926 INFO L225 Difference]: With dead ends: 927 [2024-11-10 00:03:42,927 INFO L226 Difference]: Without dead ends: 625 [2024-11-10 00:03:42,928 INFO L431 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 [2024-11-10 00:03:42,931 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 108 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:42,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 407 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-10 00:03:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 623. [2024-11-10 00:03:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.5144694533762058) internal successors, (942), 622 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 942 transitions. [2024-11-10 00:03:42,959 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 942 transitions. Word has length 89 [2024-11-10 00:03:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 942 transitions. [2024-11-10 00:03:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 942 transitions. [2024-11-10 00:03:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 00:03:42,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:42,961 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:42,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:03:42,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:42,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1554384359, now seen corresponding path program 1 times [2024-11-10 00:03:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956219170] [2024-11-10 00:03:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956219170] [2024-11-10 00:03:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956219170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279699265] [2024-11-10 00:03:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:43,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:43,066 INFO L87 Difference]: Start difference. First operand 623 states and 942 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:43,090 INFO L93 Difference]: Finished difference Result 1699 states and 2616 transitions. [2024-11-10 00:03:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-10 00:03:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:43,105 INFO L225 Difference]: With dead ends: 1699 [2024-11-10 00:03:43,106 INFO L226 Difference]: Without dead ends: 1129 [2024-11-10 00:03:43,108 INFO L431 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 [2024-11-10 00:03:43,109 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 103 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:43,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 403 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-11-10 00:03:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1127. [2024-11-10 00:03:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.5257548845470692) internal successors, (1718), 1126 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1718 transitions. [2024-11-10 00:03:43,136 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1718 transitions. Word has length 90 [2024-11-10 00:03:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1718 transitions. [2024-11-10 00:03:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1718 transitions. [2024-11-10 00:03:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:03:43,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:43,138 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:03:43,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash 692016510, now seen corresponding path program 1 times [2024-11-10 00:03:43,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779389181] [2024-11-10 00:03:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:43,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779389181] [2024-11-10 00:03:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779389181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927667933] [2024-11-10 00:03:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:43,204 INFO L87 Difference]: Start difference. First operand 1127 states and 1718 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) [2024-11-10 00:03:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:43,228 INFO L93 Difference]: Finished difference Result 3147 states and 4840 transitions. [2024-11-10 00:03:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:43,229 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 [2024-11-10 00:03:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:43,235 INFO L225 Difference]: With dead ends: 3147 [2024-11-10 00:03:43,235 INFO L226 Difference]: Without dead ends: 2073 [2024-11-10 00:03:43,237 INFO L431 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 [2024-11-10 00:03:43,238 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 98 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:43,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2024-11-10 00:03:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2071. [2024-11-10 00:03:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2070 states have (on average 1.5256038647342995) internal successors, (3158), 2070 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3158 transitions. [2024-11-10 00:03:43,270 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3158 transitions. Word has length 91 [2024-11-10 00:03:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:43,270 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3158 transitions. [2024-11-10 00:03:43,270 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) [2024-11-10 00:03:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3158 transitions. [2024-11-10 00:03:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:03:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:43,271 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:03:43,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash -401193039, now seen corresponding path program 1 times [2024-11-10 00:03:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756472890] [2024-11-10 00:03:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756472890] [2024-11-10 00:03:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756472890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:43,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615368023] [2024-11-10 00:03:43,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:43,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:43,341 INFO L87 Difference]: Start difference. First operand 2071 states and 3158 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:43,378 INFO L93 Difference]: Finished difference Result 5851 states and 8952 transitions. [2024-11-10 00:03:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 00:03:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:43,390 INFO L225 Difference]: With dead ends: 5851 [2024-11-10 00:03:43,392 INFO L226 Difference]: Without dead ends: 3833 [2024-11-10 00:03:43,395 INFO L431 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 [2024-11-10 00:03:43,396 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 93 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:43,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 395 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2024-11-10 00:03:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3831. [2024-11-10 00:03:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 3830 states have (on average 1.5180156657963446) internal successors, (5814), 3830 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 5814 transitions. [2024-11-10 00:03:43,476 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 5814 transitions. Word has length 92 [2024-11-10 00:03:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:43,477 INFO L471 AbstractCegarLoop]: Abstraction has 3831 states and 5814 transitions. [2024-11-10 00:03:43,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 5814 transitions. [2024-11-10 00:03:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:03:43,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:43,479 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:03:43,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2061622132, now seen corresponding path program 1 times [2024-11-10 00:03:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118748604] [2024-11-10 00:03:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118748604] [2024-11-10 00:03:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118748604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322340882] [2024-11-10 00:03:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:43,685 INFO L87 Difference]: Start difference. First operand 3831 states and 5814 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:44,271 INFO L93 Difference]: Finished difference Result 56723 states and 86468 transitions. [2024-11-10 00:03:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:03:44,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 00:03:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:44,476 INFO L225 Difference]: With dead ends: 56723 [2024-11-10 00:03:44,477 INFO L226 Difference]: Without dead ends: 52945 [2024-11-10 00:03:44,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:03:44,506 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1962 mSDsluCounter, 5694 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 5876 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:44,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 5876 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:03:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52945 states. [2024-11-10 00:03:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52945 to 7607. [2024-11-10 00:03:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7607 states, 7606 states have (on average 1.5048645805942678) internal successors, (11446), 7606 states have internal predecessors, (11446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 11446 transitions. [2024-11-10 00:03:45,054 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 11446 transitions. Word has length 93 [2024-11-10 00:03:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:45,055 INFO L471 AbstractCegarLoop]: Abstraction has 7607 states and 11446 transitions. [2024-11-10 00:03:45,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 11446 transitions. [2024-11-10 00:03:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:03:45,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:45,059 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:45,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:03:45,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:45,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1665169886, now seen corresponding path program 1 times [2024-11-10 00:03:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535190904] [2024-11-10 00:03:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535190904] [2024-11-10 00:03:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535190904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:45,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405613919] [2024-11-10 00:03:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:45,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:45,471 INFO L87 Difference]: Start difference. First operand 7607 states and 11446 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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) [2024-11-10 00:03:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:45,829 INFO L93 Difference]: Finished difference Result 15163 states and 22840 transitions. [2024-11-10 00:03:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:03:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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 [2024-11-10 00:03:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:45,842 INFO L225 Difference]: With dead ends: 15163 [2024-11-10 00:03:45,843 INFO L226 Difference]: Without dead ends: 7609 [2024-11-10 00:03:45,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:03:45,853 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 230 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:45,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1021 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2024-11-10 00:03:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 7607. [2024-11-10 00:03:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7607 states, 7606 states have (on average 1.4964501709176965) internal successors, (11382), 7606 states have internal predecessors, (11382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 11382 transitions. [2024-11-10 00:03:45,993 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 11382 transitions. Word has length 96 [2024-11-10 00:03:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:45,993 INFO L471 AbstractCegarLoop]: Abstraction has 7607 states and 11382 transitions. [2024-11-10 00:03:45,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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) [2024-11-10 00:03:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 11382 transitions. [2024-11-10 00:03:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:03:45,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:45,995 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:45,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:03:45,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:45,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1404657066, now seen corresponding path program 1 times [2024-11-10 00:03:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:45,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531430836] [2024-11-10 00:03:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531430836] [2024-11-10 00:03:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531430836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:46,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25959291] [2024-11-10 00:03:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:46,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:46,069 INFO L87 Difference]: Start difference. First operand 7607 states and 11382 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2024-11-10 00:03:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:46,156 INFO L93 Difference]: Finished difference Result 21435 states and 31992 transitions. [2024-11-10 00:03:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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 [2024-11-10 00:03:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:46,176 INFO L225 Difference]: With dead ends: 21435 [2024-11-10 00:03:46,177 INFO L226 Difference]: Without dead ends: 13881 [2024-11-10 00:03:46,183 INFO L431 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 [2024-11-10 00:03:46,184 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 120 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:46,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 427 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13881 states. [2024-11-10 00:03:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13881 to 13879. [2024-11-10 00:03:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13879 states, 13878 states have (on average 1.4796080126819426) internal successors, (20534), 13878 states have internal predecessors, (20534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13879 states to 13879 states and 20534 transitions. [2024-11-10 00:03:46,363 INFO L78 Accepts]: Start accepts. Automaton has 13879 states and 20534 transitions. Word has length 96 [2024-11-10 00:03:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:46,363 INFO L471 AbstractCegarLoop]: Abstraction has 13879 states and 20534 transitions. [2024-11-10 00:03:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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) [2024-11-10 00:03:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13879 states and 20534 transitions. [2024-11-10 00:03:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:03:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:46,364 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:03:46,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1845695973, now seen corresponding path program 1 times [2024-11-10 00:03:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485459567] [2024-11-10 00:03:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485459567] [2024-11-10 00:03:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485459567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933713750] [2024-11-10 00:03:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:46,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:46,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:46,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:46,445 INFO L87 Difference]: Start difference. First operand 13879 states and 20534 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:46,527 INFO L93 Difference]: Finished difference Result 34429 states and 51002 transitions. [2024-11-10 00:03:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:03:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:46,560 INFO L225 Difference]: With dead ends: 34429 [2024-11-10 00:03:46,561 INFO L226 Difference]: Without dead ends: 20603 [2024-11-10 00:03:46,580 INFO L431 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 [2024-11-10 00:03:46,580 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 83 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:46,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20603 states. [2024-11-10 00:03:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20603 to 20473. [2024-11-10 00:03:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20473 states, 20472 states have (on average 1.4689331770222742) internal successors, (30072), 20472 states have internal predecessors, (30072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 30072 transitions. [2024-11-10 00:03:46,883 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 30072 transitions. Word has length 98 [2024-11-10 00:03:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:46,884 INFO L471 AbstractCegarLoop]: Abstraction has 20473 states and 30072 transitions. [2024-11-10 00:03:46,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 30072 transitions. [2024-11-10 00:03:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 00:03:46,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:46,884 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:46,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:03:46,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:46,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1973501417, now seen corresponding path program 1 times [2024-11-10 00:03:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968065392] [2024-11-10 00:03:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:46,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968065392] [2024-11-10 00:03:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968065392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:46,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:03:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638485950] [2024-11-10 00:03:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:46,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:03:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:03:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:03:46,981 INFO L87 Difference]: Start difference. First operand 20473 states and 30072 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:47,221 INFO L93 Difference]: Finished difference Result 40891 states and 60089 transitions. [2024-11-10 00:03:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:03:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-10 00:03:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:47,249 INFO L225 Difference]: With dead ends: 40891 [2024-11-10 00:03:47,250 INFO L226 Difference]: Without dead ends: 20473 [2024-11-10 00:03:47,264 INFO L431 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 [2024-11-10 00:03:47,265 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 439 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:47,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 153 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20473 states. [2024-11-10 00:03:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20473 to 20473. [2024-11-10 00:03:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20473 states, 20472 states have (on average 1.4595545134818289) internal successors, (29880), 20472 states have internal predecessors, (29880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 29880 transitions. [2024-11-10 00:03:47,489 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 29880 transitions. Word has length 99 [2024-11-10 00:03:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:47,489 INFO L471 AbstractCegarLoop]: Abstraction has 20473 states and 29880 transitions. [2024-11-10 00:03:47,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 29880 transitions. [2024-11-10 00:03:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 00:03:47,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:47,490 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:47,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:03:47,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:47,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash -101056330, now seen corresponding path program 1 times [2024-11-10 00:03:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345980073] [2024-11-10 00:03:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345980073] [2024-11-10 00:03:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345980073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:47,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:03:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006795318] [2024-11-10 00:03:47,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:47,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:03:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:03:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:03:47,899 INFO L87 Difference]: Start difference. First operand 20473 states and 29880 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:47,969 INFO L93 Difference]: Finished difference Result 21499 states and 31161 transitions. [2024-11-10 00:03:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:03:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-10 00:03:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:48,003 INFO L225 Difference]: With dead ends: 21499 [2024-11-10 00:03:48,003 INFO L226 Difference]: Without dead ends: 21497 [2024-11-10 00:03:48,012 INFO L431 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 [2024-11-10 00:03:48,012 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:48,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 717 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21497 states. [2024-11-10 00:03:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21497 to 21497. [2024-11-10 00:03:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21497 states, 21496 states have (on average 1.4346855228879791) internal successors, (30840), 21496 states have internal predecessors, (30840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21497 states to 21497 states and 30840 transitions. [2024-11-10 00:03:48,322 INFO L78 Accepts]: Start accepts. Automaton has 21497 states and 30840 transitions. Word has length 99 [2024-11-10 00:03:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:48,323 INFO L471 AbstractCegarLoop]: Abstraction has 21497 states and 30840 transitions. [2024-11-10 00:03:48,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 21497 states and 30840 transitions. [2024-11-10 00:03:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:03:48,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:48,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:48,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:03:48,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1699880118, now seen corresponding path program 1 times [2024-11-10 00:03:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585940517] [2024-11-10 00:03:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:03:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585940517] [2024-11-10 00:03:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585940517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67572791] [2024-11-10 00:03:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:48,579 INFO L87 Difference]: Start difference. First operand 21497 states and 30840 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:49,124 INFO L93 Difference]: Finished difference Result 175817 states and 252128 transitions. [2024-11-10 00:03:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:03:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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 134 [2024-11-10 00:03:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:49,322 INFO L225 Difference]: With dead ends: 175817 [2024-11-10 00:03:49,322 INFO L226 Difference]: Without dead ends: 154375 [2024-11-10 00:03:49,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:03:49,387 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1643 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:49,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 2617 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154375 states. [2024-11-10 00:03:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154375 to 42937. [2024-11-10 00:03:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42937 states, 42936 states have (on average 1.4307806968511272) internal successors, (61432), 42936 states have internal predecessors, (61432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42937 states to 42937 states and 61432 transitions. [2024-11-10 00:03:50,804 INFO L78 Accepts]: Start accepts. Automaton has 42937 states and 61432 transitions. Word has length 134 [2024-11-10 00:03:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:50,804 INFO L471 AbstractCegarLoop]: Abstraction has 42937 states and 61432 transitions. [2024-11-10 00:03:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42937 states and 61432 transitions. [2024-11-10 00:03:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:03:50,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:50,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:03:50,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 331958519, now seen corresponding path program 1 times [2024-11-10 00:03:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:50,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315387738] [2024-11-10 00:03:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:03:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315387738] [2024-11-10 00:03:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315387738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80978186] [2024-11-10 00:03:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:51,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:51,007 INFO L87 Difference]: Start difference. First operand 42937 states and 61432 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:52,070 INFO L93 Difference]: Finished difference Result 197257 states and 282720 transitions. [2024-11-10 00:03:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:03:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 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 134 [2024-11-10 00:03:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:52,360 INFO L225 Difference]: With dead ends: 197257 [2024-11-10 00:03:52,360 INFO L226 Difference]: Without dead ends: 175815 [2024-11-10 00:03:52,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:03:52,389 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1676 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:52,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2425 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175815 states. [2024-11-10 00:03:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175815 to 75193. [2024-11-10 00:03:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75193 states, 75192 states have (on average 1.426002766251729) internal successors, (107224), 75192 states have internal predecessors, (107224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75193 states to 75193 states and 107224 transitions. [2024-11-10 00:03:54,114 INFO L78 Accepts]: Start accepts. Automaton has 75193 states and 107224 transitions. Word has length 134 [2024-11-10 00:03:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:54,115 INFO L471 AbstractCegarLoop]: Abstraction has 75193 states and 107224 transitions. [2024-11-10 00:03:54,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 75193 states and 107224 transitions. [2024-11-10 00:03:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:03:54,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:54,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:03:54,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 441116374, now seen corresponding path program 1 times [2024-11-10 00:03:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155676734] [2024-11-10 00:03:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:03:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155676734] [2024-11-10 00:03:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155676734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297931619] [2024-11-10 00:03:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:54,553 INFO L87 Difference]: Start difference. First operand 75193 states and 107224 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:55,363 INFO L93 Difference]: Finished difference Result 218697 states and 313312 transitions. [2024-11-10 00:03:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:03:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 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 134 [2024-11-10 00:03:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:55,651 INFO L225 Difference]: With dead ends: 218697 [2024-11-10 00:03:55,651 INFO L226 Difference]: Without dead ends: 197255 [2024-11-10 00:03:55,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:03:55,674 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1741 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:55,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 2294 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197255 states. [2024-11-10 00:03:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197255 to 96633. [2024-11-10 00:03:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96633 states, 96632 states have (on average 1.4261942213759418) internal successors, (137816), 96632 states have internal predecessors, (137816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96633 states to 96633 states and 137816 transitions. [2024-11-10 00:03:57,805 INFO L78 Accepts]: Start accepts. Automaton has 96633 states and 137816 transitions. Word has length 134 [2024-11-10 00:03:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 96633 states and 137816 transitions. [2024-11-10 00:03:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 96633 states and 137816 transitions. [2024-11-10 00:03:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:03:57,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:57,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:03:57,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:57,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1800477673, now seen corresponding path program 1 times [2024-11-10 00:03:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:57,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616880898] [2024-11-10 00:03:57,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:03:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616880898] [2024-11-10 00:03:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616880898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087273680] [2024-11-10 00:03:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:03:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:03:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:03:58,066 INFO L87 Difference]: Start difference. First operand 96633 states and 137816 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:59,004 INFO L93 Difference]: Finished difference Result 240137 states and 343904 transitions. [2024-11-10 00:03:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:03:59,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 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 134 [2024-11-10 00:03:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:59,341 INFO L225 Difference]: With dead ends: 240137 [2024-11-10 00:03:59,341 INFO L226 Difference]: Without dead ends: 218695 [2024-11-10 00:03:59,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:03:59,385 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1805 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:59,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1805 Valid, 2282 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218695 states. [2024-11-10 00:04:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218695 to 118073. [2024-11-10 00:04:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118073 states, 118072 states have (on average 1.4263161460803577) internal successors, (168408), 118072 states have internal predecessors, (168408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118073 states to 118073 states and 168408 transitions. [2024-11-10 00:04:01,825 INFO L78 Accepts]: Start accepts. Automaton has 118073 states and 168408 transitions. Word has length 134 [2024-11-10 00:04:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:01,825 INFO L471 AbstractCegarLoop]: Abstraction has 118073 states and 168408 transitions. [2024-11-10 00:04:01,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 118073 states and 168408 transitions. [2024-11-10 00:04:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:04:01,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:01,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:04:01,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:04:01,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash -314584842, now seen corresponding path program 1 times [2024-11-10 00:04:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980666183] [2024-11-10 00:04:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 00:04:02,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:02,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980666183] [2024-11-10 00:04:02,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980666183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:02,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:02,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:04:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789687782] [2024-11-10 00:04:02,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:02,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:04:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:04:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:04:02,032 INFO L87 Difference]: Start difference. First operand 118073 states and 168408 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:03,153 INFO L93 Difference]: Finished difference Result 261577 states and 374496 transitions. [2024-11-10 00:04:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:04:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 134 [2024-11-10 00:04:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:03,520 INFO L225 Difference]: With dead ends: 261577 [2024-11-10 00:04:03,520 INFO L226 Difference]: Without dead ends: 240135 [2024-11-10 00:04:03,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:04:03,616 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1891 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:03,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 2323 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:04:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240135 states. [2024-11-10 00:04:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240135 to 139513. [2024-11-10 00:04:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139513 states, 139512 states have (on average 1.4264005963644704) internal successors, (199000), 139512 states have internal predecessors, (199000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139513 states to 139513 states and 199000 transitions. [2024-11-10 00:04:07,016 INFO L78 Accepts]: Start accepts. Automaton has 139513 states and 199000 transitions. Word has length 134 [2024-11-10 00:04:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:07,016 INFO L471 AbstractCegarLoop]: Abstraction has 139513 states and 199000 transitions. [2024-11-10 00:04:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 139513 states and 199000 transitions. [2024-11-10 00:04:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 00:04:07,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:07,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:04:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:04:07,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:07,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash -235823305, now seen corresponding path program 1 times [2024-11-10 00:04:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984839640] [2024-11-10 00:04:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 00:04:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984839640] [2024-11-10 00:04:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984839640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:04:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684483828] [2024-11-10 00:04:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:04:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:04:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:04:07,227 INFO L87 Difference]: Start difference. First operand 139513 states and 199000 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:08,125 INFO L93 Difference]: Finished difference Result 283017 states and 405088 transitions. [2024-11-10 00:04:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:04:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 134 [2024-11-10 00:04:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:08,998 INFO L225 Difference]: With dead ends: 283017 [2024-11-10 00:04:08,999 INFO L226 Difference]: Without dead ends: 261575 [2024-11-10 00:04:09,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:04:09,061 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1661 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:09,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2554 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:04:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261575 states. [2024-11-10 00:04:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261575 to 160953. [2024-11-10 00:04:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160953 states, 160952 states have (on average 1.4264625478403499) internal successors, (229592), 160952 states have internal predecessors, (229592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160953 states to 160953 states and 229592 transitions. [2024-11-10 00:04:11,910 INFO L78 Accepts]: Start accepts. Automaton has 160953 states and 229592 transitions. Word has length 134 [2024-11-10 00:04:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:11,911 INFO L471 AbstractCegarLoop]: Abstraction has 160953 states and 229592 transitions. [2024-11-10 00:04:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 160953 states and 229592 transitions. [2024-11-10 00:04:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 00:04:11,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:11,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:04:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:04:11,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 846288135, now seen corresponding path program 1 times [2024-11-10 00:04:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689003411] [2024-11-10 00:04:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 00:04:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689003411] [2024-11-10 00:04:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689003411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:04:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401708104] [2024-11-10 00:04:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:04:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:04:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:04:12,162 INFO L87 Difference]: Start difference. First operand 160953 states and 229592 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:13,717 INFO L93 Difference]: Finished difference Result 291273 states and 416864 transitions. [2024-11-10 00:04:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:04:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 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 135 [2024-11-10 00:04:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:14,161 INFO L225 Difference]: With dead ends: 291273 [2024-11-10 00:04:14,161 INFO L226 Difference]: Without dead ends: 276423 [2024-11-10 00:04:14,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 00:04:14,227 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1632 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:14,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 3036 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:04:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276423 states. [2024-11-10 00:04:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276423 to 175801. [2024-11-10 00:04:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175801 states, 175800 states have (on average 1.426848691695108) internal successors, (250840), 175800 states have internal predecessors, (250840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175801 states to 175801 states and 250840 transitions. [2024-11-10 00:04:17,247 INFO L78 Accepts]: Start accepts. Automaton has 175801 states and 250840 transitions. Word has length 135 [2024-11-10 00:04:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 175801 states and 250840 transitions. [2024-11-10 00:04:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 175801 states and 250840 transitions. [2024-11-10 00:04:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 00:04:17,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:17,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:04:17,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:04:17,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:17,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 836835410, now seen corresponding path program 1 times [2024-11-10 00:04:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856557172] [2024-11-10 00:04:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:04:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856557172] [2024-11-10 00:04:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856557172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:04:17,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:04:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:04:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971930570] [2024-11-10 00:04:17,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:04:17,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:04:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:17,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:04:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:04:17,399 INFO L87 Difference]: Start difference. First operand 175801 states and 250840 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:04:18,996 INFO L93 Difference]: Finished difference Result 302066 states and 431517 transitions. [2024-11-10 00:04:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:04:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-10 00:04:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:04:19,182 INFO L225 Difference]: With dead ends: 302066 [2024-11-10 00:04:19,182 INFO L226 Difference]: Without dead ends: 126320 [2024-11-10 00:04:19,309 INFO L431 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 [2024-11-10 00:04:19,309 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 83 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:04:19,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 410 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:04:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126320 states. [2024-11-10 00:04:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126320 to 126318. [2024-11-10 00:04:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126318 states, 126317 states have (on average 1.4221522043747081) internal successors, (179642), 126317 states have internal predecessors, (179642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126318 states to 126318 states and 179642 transitions. [2024-11-10 00:04:21,336 INFO L78 Accepts]: Start accepts. Automaton has 126318 states and 179642 transitions. Word has length 136 [2024-11-10 00:04:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:04:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 126318 states and 179642 transitions. [2024-11-10 00:04:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:04:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 126318 states and 179642 transitions. [2024-11-10 00:04:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 00:04:21,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:04:21,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:04:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:04:21,346 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:04:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:04:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2053352414, now seen corresponding path program 1 times [2024-11-10 00:04:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:04:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911842271] [2024-11-10 00:04:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:04:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:04:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:04:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911842271] [2024-11-10 00:04:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911842271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:04:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876351571] [2024-11-10 00:04:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:04:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:04:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:04:22,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:04:22,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:04:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:04:22,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:04:22,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:04:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:04:23,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:04:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:04:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876351571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:04:24,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:04:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:04:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410037727] [2024-11-10 00:04:24,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:04:24,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:04:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:04:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:04:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:04:24,104 INFO L87 Difference]: Start difference. First operand 126318 states and 179642 transitions. Second operand has 26 states, 26 states have (on average 15.346153846153847) internal successors, (399), 25 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)