./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:55:49,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:55:49,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:55:49,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:55:49,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:55:49,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:55:49,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:55:49,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:55:49,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:55:49,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:55:49,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:55:49,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:55:49,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:55:49,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:55:49,550 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:55:49,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:55:49,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:55:49,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:55:49,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:55:49,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:55:49,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:55:49,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:55:49,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:55:49,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:55:49,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:55:49,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:55:49,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:55:49,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:55:49,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:55:49,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:55:49,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:55:49,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:55:49,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:55:49,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:55:49,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:55:49,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:55:49,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:55:49,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:55:49,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:55:49,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:55:49,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:55:49,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:55:49,563 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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2024-10-14 03:55:49,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:55:49,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:55:49,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:55:49,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:55:49,832 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:55:49,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:55:51,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:55:51,511 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:55:51,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:55:51,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59653bf32/87fbee5ee7794b948ad9913c1138842c/FLAG4cb074f76 [2024-10-14 03:55:51,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59653bf32/87fbee5ee7794b948ad9913c1138842c [2024-10-14 03:55:51,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:55:51,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:55:51,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:55:51,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:55:51,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:55:51,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:55:51" (1/1) ... [2024-10-14 03:55:51,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171ce02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:51, skipping insertion in model container [2024-10-14 03:55:51,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:55:51" (1/1) ... [2024-10-14 03:55:51,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:55:51,846 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2024-10-14 03:55:51,879 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2024-10-14 03:55:51,895 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2024-10-14 03:55:51,906 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2024-10-14 03:55:51,914 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2024-10-14 03:55:51,919 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2024-10-14 03:55:51,924 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2024-10-14 03:55:51,936 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2024-10-14 03:55:51,940 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2024-10-14 03:55:51,947 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2024-10-14 03:55:51,956 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2024-10-14 03:55:52,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:55:52,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:55:52,147 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2024-10-14 03:55:52,173 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2024-10-14 03:55:52,181 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2024-10-14 03:55:52,187 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2024-10-14 03:55:52,228 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2024-10-14 03:55:52,235 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2024-10-14 03:55:52,238 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2024-10-14 03:55:52,258 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2024-10-14 03:55:52,262 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2024-10-14 03:55:52,266 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2024-10-14 03:55:52,274 WARN L248 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2024-10-14 03:55:52,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:55:52,394 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:55:52,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52 WrapperNode [2024-10-14 03:55:52,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:55:52,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:55:52,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:55:52,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:55:52,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,473 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1924 [2024-10-14 03:55:52,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:55:52,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:55:52,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:55:52,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:55:52,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,544 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-10-14 03:55:52,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:55:52,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:55:52,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:55:52,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:55:52,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (1/1) ... [2024-10-14 03:55:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:55:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:55:52,663 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-10-14 03:55:52,666 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-10-14 03:55:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:55:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:55:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:55:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:55:52,871 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:55:52,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:55:53,965 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-10-14 03:55:53,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:55:54,010 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:55:54,010 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:55:54,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:55:54 BoogieIcfgContainer [2024-10-14 03:55:54,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:55:54,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:55:54,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:55:54,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:55:54,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:55:51" (1/3) ... [2024-10-14 03:55:54,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e92e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:55:54, skipping insertion in model container [2024-10-14 03:55:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:55:52" (2/3) ... [2024-10-14 03:55:54,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8e92e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:55:54, skipping insertion in model container [2024-10-14 03:55:54,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:55:54" (3/3) ... [2024-10-14 03:55:54,023 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:55:54,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:55:54,038 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-14 03:55:54,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:55:54,123 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;@5f714806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:55:54,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-14 03:55:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 355 states, 343 states have (on average 1.8425655976676385) internal successors, (632), 354 states have internal predecessors, (632), 0 states have call successors, (0), 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-10-14 03:55:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 03:55:54,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:54,145 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] [2024-10-14 03:55:54,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:54,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1432511949, now seen corresponding path program 1 times [2024-10-14 03:55:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933189955] [2024-10-14 03:55:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933189955] [2024-10-14 03:55:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933189955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:54,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:54,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:54,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214614626] [2024-10-14 03:55:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:54,745 INFO L87 Difference]: Start difference. First operand has 355 states, 343 states have (on average 1.8425655976676385) internal successors, (632), 354 states have internal predecessors, (632), 0 states have call successors, (0), 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 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:55,132 INFO L93 Difference]: Finished difference Result 564 states and 967 transitions. [2024-10-14 03:55:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-14 03:55:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:55,148 INFO L225 Difference]: With dead ends: 564 [2024-10-14 03:55:55,148 INFO L226 Difference]: Without dead ends: 301 [2024-10-14 03:55:55,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:55,159 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1457 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:55,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 377 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:55:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-14 03:55:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-14 03:55:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.293103448275862) internal successors, (375), 300 states have internal predecessors, (375), 0 states have call successors, (0), 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-10-14 03:55:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 375 transitions. [2024-10-14 03:55:55,225 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 375 transitions. Word has length 57 [2024-10-14 03:55:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:55,227 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 375 transitions. [2024-10-14 03:55:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:55:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions. [2024-10-14 03:55:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 03:55:55,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:55,232 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] [2024-10-14 03:55:55,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:55:55,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:55,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1451472122, now seen corresponding path program 1 times [2024-10-14 03:55:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030429382] [2024-10-14 03:55:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030429382] [2024-10-14 03:55:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030429382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:55,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108138134] [2024-10-14 03:55:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:55,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:55,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:55,485 INFO L87 Difference]: Start difference. First operand 301 states and 375 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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-10-14 03:55:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:55,737 INFO L93 Difference]: Finished difference Result 504 states and 645 transitions. [2024-10-14 03:55:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-14 03:55:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:55,739 INFO L225 Difference]: With dead ends: 504 [2024-10-14 03:55:55,740 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 03:55:55,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:55,741 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 978 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:55,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 212 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 03:55:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-14 03:55:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 270 states have (on average 1.2962962962962963) internal successors, (350), 280 states have internal predecessors, (350), 0 states have call successors, (0), 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-10-14 03:55:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 350 transitions. [2024-10-14 03:55:55,767 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 350 transitions. Word has length 58 [2024-10-14 03:55:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:55,767 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 350 transitions. [2024-10-14 03:55:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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-10-14 03:55:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 350 transitions. [2024-10-14 03:55:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:55:55,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:55,773 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] [2024-10-14 03:55:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:55:55,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1444601844, now seen corresponding path program 1 times [2024-10-14 03:55:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537868895] [2024-10-14 03:55:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537868895] [2024-10-14 03:55:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537868895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542699724] [2024-10-14 03:55:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:55,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:55,913 INFO L87 Difference]: Start difference. First operand 281 states and 350 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 03:55:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:56,116 INFO L93 Difference]: Finished difference Result 484 states and 619 transitions. [2024-10-14 03:55:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-14 03:55:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:56,118 INFO L225 Difference]: With dead ends: 484 [2024-10-14 03:55:56,118 INFO L226 Difference]: Without dead ends: 259 [2024-10-14 03:55:56,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:56,120 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 930 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:56,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 200 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-14 03:55:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-14 03:55:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 248 states have (on average 1.310483870967742) internal successors, (325), 258 states have internal predecessors, (325), 0 states have call successors, (0), 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-10-14 03:55:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 325 transitions. [2024-10-14 03:55:56,129 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 325 transitions. Word has length 59 [2024-10-14 03:55:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:56,130 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 325 transitions. [2024-10-14 03:55:56,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-10-14 03:55:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 325 transitions. [2024-10-14 03:55:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:55:56,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:56,132 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] [2024-10-14 03:55:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:55:56,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -98923345, now seen corresponding path program 1 times [2024-10-14 03:55:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41440447] [2024-10-14 03:55:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:56,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-10-14 03:55:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41440447] [2024-10-14 03:55:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41440447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:55:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704089679] [2024-10-14 03:55:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:56,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:55:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:55:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:55:56,288 INFO L87 Difference]: Start difference. First operand 259 states and 325 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-14 03:55:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:56,531 INFO L93 Difference]: Finished difference Result 596 states and 770 transitions. [2024-10-14 03:55:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:55:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-14 03:55:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:56,533 INFO L225 Difference]: With dead ends: 596 [2024-10-14 03:55:56,533 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 03:55:56,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:56,535 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1245 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:56,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 294 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:55:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 03:55:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 337. [2024-10-14 03:55:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3742331288343559) internal successors, (448), 336 states have internal predecessors, (448), 0 states have call successors, (0), 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-10-14 03:55:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 448 transitions. [2024-10-14 03:55:56,545 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 448 transitions. Word has length 60 [2024-10-14 03:55:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 448 transitions. [2024-10-14 03:55:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-14 03:55:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 448 transitions. [2024-10-14 03:55:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:55:56,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:56,547 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] [2024-10-14 03:55:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:55:56,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1012719179, now seen corresponding path program 1 times [2024-10-14 03:55:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386889643] [2024-10-14 03:55:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386889643] [2024-10-14 03:55:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386889643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421945603] [2024-10-14 03:55:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:56,876 INFO L87 Difference]: Start difference. First operand 337 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:57,408 INFO L93 Difference]: Finished difference Result 614 states and 829 transitions. [2024-10-14 03:55:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-14 03:55:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:57,412 INFO L225 Difference]: With dead ends: 614 [2024-10-14 03:55:57,412 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 03:55:57,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:55:57,413 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1294 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:57,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 779 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:55:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 03:55:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 337. [2024-10-14 03:55:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3711656441717792) internal successors, (447), 336 states have internal predecessors, (447), 0 states have call successors, (0), 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-10-14 03:55:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2024-10-14 03:55:57,426 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 61 [2024-10-14 03:55:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2024-10-14 03:55:57,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2024-10-14 03:55:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:55:57,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:57,428 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] [2024-10-14 03:55:57,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:55:57,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 603873951, now seen corresponding path program 1 times [2024-10-14 03:55:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212879829] [2024-10-14 03:55:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212879829] [2024-10-14 03:55:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212879829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:57,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:55:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70488594] [2024-10-14 03:55:57,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:57,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:55:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:55:57,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:55:57,747 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:58,311 INFO L93 Difference]: Finished difference Result 666 states and 911 transitions. [2024-10-14 03:55:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:55:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-14 03:55:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:58,314 INFO L225 Difference]: With dead ends: 666 [2024-10-14 03:55:58,314 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 03:55:58,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:55:58,316 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 940 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:58,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1108 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:55:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 03:55:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-10-14 03:55:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3680981595092025) internal successors, (446), 336 states have internal predecessors, (446), 0 states have call successors, (0), 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-10-14 03:55:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 446 transitions. [2024-10-14 03:55:58,327 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 446 transitions. Word has length 61 [2024-10-14 03:55:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 446 transitions. [2024-10-14 03:55:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2024-10-14 03:55:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:55:58,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:58,329 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] [2024-10-14 03:55:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:55:58,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1551029823, now seen corresponding path program 1 times [2024-10-14 03:55:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586034607] [2024-10-14 03:55:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586034607] [2024-10-14 03:55:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586034607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:55:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894639064] [2024-10-14 03:55:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:58,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:55:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:55:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:55:58,711 INFO L87 Difference]: Start difference. First operand 337 states and 446 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:59,294 INFO L93 Difference]: Finished difference Result 640 states and 862 transitions. [2024-10-14 03:55:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:55:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-14 03:55:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:59,296 INFO L225 Difference]: With dead ends: 640 [2024-10-14 03:55:59,296 INFO L226 Difference]: Without dead ends: 470 [2024-10-14 03:55:59,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:55:59,297 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1292 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:59,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1083 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:55:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-14 03:55:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 337. [2024-10-14 03:55:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.361963190184049) internal successors, (444), 336 states have internal predecessors, (444), 0 states have call successors, (0), 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-10-14 03:55:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 444 transitions. [2024-10-14 03:55:59,304 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 444 transitions. Word has length 61 [2024-10-14 03:55:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:55:59,305 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 444 transitions. [2024-10-14 03:55:59,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 444 transitions. [2024-10-14 03:55:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:55:59,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:55:59,306 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] [2024-10-14 03:55:59,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:55:59,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:55:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:55:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -427677757, now seen corresponding path program 1 times [2024-10-14 03:55:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:55:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158390927] [2024-10-14 03:55:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:55:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:55:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:55:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:55:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:55:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158390927] [2024-10-14 03:55:59,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158390927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:55:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:55:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:55:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178702824] [2024-10-14 03:55:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:55:59,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:55:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:55:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:55:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:55:59,577 INFO L87 Difference]: Start difference. First operand 337 states and 444 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:55:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:00,000 INFO L93 Difference]: Finished difference Result 687 states and 912 transitions. [2024-10-14 03:56:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:56:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-14 03:56:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:00,002 INFO L225 Difference]: With dead ends: 687 [2024-10-14 03:56:00,003 INFO L226 Difference]: Without dead ends: 502 [2024-10-14 03:56:00,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:56:00,005 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 850 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:00,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 762 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-14 03:56:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 337. [2024-10-14 03:56:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3588957055214723) internal successors, (443), 336 states have internal predecessors, (443), 0 states have call successors, (0), 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-10-14 03:56:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 443 transitions. [2024-10-14 03:56:00,018 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 443 transitions. Word has length 61 [2024-10-14 03:56:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:00,018 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 443 transitions. [2024-10-14 03:56:00,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 03:56:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 443 transitions. [2024-10-14 03:56:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:00,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:00,019 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] [2024-10-14 03:56:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:56:00,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:00,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:00,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1026541166, now seen corresponding path program 1 times [2024-10-14 03:56:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181568054] [2024-10-14 03:56:00,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181568054] [2024-10-14 03:56:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181568054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460818723] [2024-10-14 03:56:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:00,289 INFO L87 Difference]: Start difference. First operand 337 states and 443 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:00,741 INFO L93 Difference]: Finished difference Result 639 states and 863 transitions. [2024-10-14 03:56:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:56:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:00,744 INFO L225 Difference]: With dead ends: 639 [2024-10-14 03:56:00,745 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 03:56:00,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:56:00,746 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1228 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:00,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 780 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 03:56:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-10-14 03:56:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3558282208588956) internal successors, (442), 336 states have internal predecessors, (442), 0 states have call successors, (0), 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-10-14 03:56:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 442 transitions. [2024-10-14 03:56:00,754 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 442 transitions. Word has length 63 [2024-10-14 03:56:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:00,754 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 442 transitions. [2024-10-14 03:56:00,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 442 transitions. [2024-10-14 03:56:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:00,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:00,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] [2024-10-14 03:56:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:56:00,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:00,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 885655936, now seen corresponding path program 1 times [2024-10-14 03:56:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:00,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636983432] [2024-10-14 03:56:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636983432] [2024-10-14 03:56:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636983432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284211953] [2024-10-14 03:56:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:01,014 INFO L87 Difference]: Start difference. First operand 337 states and 442 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:01,549 INFO L93 Difference]: Finished difference Result 671 states and 910 transitions. [2024-10-14 03:56:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:01,552 INFO L225 Difference]: With dead ends: 671 [2024-10-14 03:56:01,552 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 03:56:01,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:01,553 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 712 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:01,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 988 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 03:56:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-10-14 03:56:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.352760736196319) internal successors, (441), 336 states have internal predecessors, (441), 0 states have call successors, (0), 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-10-14 03:56:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 441 transitions. [2024-10-14 03:56:01,561 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 441 transitions. Word has length 63 [2024-10-14 03:56:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:01,561 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 441 transitions. [2024-10-14 03:56:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2024-10-14 03:56:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:01,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:01,563 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] [2024-10-14 03:56:01,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:56:01,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -515644867, now seen corresponding path program 1 times [2024-10-14 03:56:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715325168] [2024-10-14 03:56:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:01,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715325168] [2024-10-14 03:56:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715325168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:01,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265514497] [2024-10-14 03:56:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:01,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:01,818 INFO L87 Difference]: Start difference. First operand 337 states and 441 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:02,353 INFO L93 Difference]: Finished difference Result 636 states and 858 transitions. [2024-10-14 03:56:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:02,356 INFO L225 Difference]: With dead ends: 636 [2024-10-14 03:56:02,356 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 03:56:02,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:02,357 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 936 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:02,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1206 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 03:56:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-10-14 03:56:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3496932515337423) internal successors, (440), 336 states have internal predecessors, (440), 0 states have call successors, (0), 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-10-14 03:56:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 440 transitions. [2024-10-14 03:56:02,364 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 440 transitions. Word has length 63 [2024-10-14 03:56:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:02,365 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 440 transitions. [2024-10-14 03:56:02,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 440 transitions. [2024-10-14 03:56:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:02,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:02,366 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] [2024-10-14 03:56:02,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:56:02,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:02,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1781677741, now seen corresponding path program 1 times [2024-10-14 03:56:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:02,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026693277] [2024-10-14 03:56:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026693277] [2024-10-14 03:56:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026693277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:02,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796146292] [2024-10-14 03:56:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:02,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:02,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:02,594 INFO L87 Difference]: Start difference. First operand 337 states and 440 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,109 INFO L93 Difference]: Finished difference Result 533 states and 699 transitions. [2024-10-14 03:56:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,112 INFO L225 Difference]: With dead ends: 533 [2024-10-14 03:56:03,112 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 03:56:03,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:03,113 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1050 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 939 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 03:56:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-10-14 03:56:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 336 states have internal predecessors, (439), 0 states have call successors, (0), 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-10-14 03:56:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 439 transitions. [2024-10-14 03:56:03,120 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 439 transitions. Word has length 63 [2024-10-14 03:56:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,120 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 439 transitions. [2024-10-14 03:56:03,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 439 transitions. [2024-10-14 03:56:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,122 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] [2024-10-14 03:56:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:56:03,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 100501655, now seen corresponding path program 1 times [2024-10-14 03:56:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116158147] [2024-10-14 03:56:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116158147] [2024-10-14 03:56:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116158147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:03,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:03,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889012200] [2024-10-14 03:56:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:03,362 INFO L87 Difference]: Start difference. First operand 337 states and 439 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:03,793 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2024-10-14 03:56:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:03,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:03,795 INFO L225 Difference]: With dead ends: 533 [2024-10-14 03:56:03,795 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 03:56:03,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:03,796 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 643 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:03,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1113 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 03:56:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-10-14 03:56:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3404907975460123) internal successors, (437), 336 states have internal predecessors, (437), 0 states have call successors, (0), 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-10-14 03:56:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 437 transitions. [2024-10-14 03:56:03,804 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 437 transitions. Word has length 63 [2024-10-14 03:56:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 437 transitions. [2024-10-14 03:56:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 437 transitions. [2024-10-14 03:56:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:03,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:03,805 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] [2024-10-14 03:56:03,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:56:03,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:03,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:03,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2012698757, now seen corresponding path program 1 times [2024-10-14 03:56:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455799774] [2024-10-14 03:56:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455799774] [2024-10-14 03:56:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455799774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:04,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817417020] [2024-10-14 03:56:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:04,052 INFO L87 Difference]: Start difference. First operand 337 states and 437 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:04,531 INFO L93 Difference]: Finished difference Result 565 states and 743 transitions. [2024-10-14 03:56:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:04,533 INFO L225 Difference]: With dead ends: 565 [2024-10-14 03:56:04,533 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 03:56:04,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:04,534 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 911 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:04,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1428 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 03:56:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-10-14 03:56:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.334355828220859) internal successors, (435), 336 states have internal predecessors, (435), 0 states have call successors, (0), 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-10-14 03:56:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 435 transitions. [2024-10-14 03:56:04,541 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 435 transitions. Word has length 63 [2024-10-14 03:56:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:04,541 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 435 transitions. [2024-10-14 03:56:04,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2024-10-14 03:56:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:04,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:04,542 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] [2024-10-14 03:56:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:56:04,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash -522081681, now seen corresponding path program 1 times [2024-10-14 03:56:04,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156979557] [2024-10-14 03:56:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156979557] [2024-10-14 03:56:05,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156979557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:05,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:05,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044035192] [2024-10-14 03:56:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:05,136 INFO L87 Difference]: Start difference. First operand 337 states and 435 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:05,895 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2024-10-14 03:56:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:05,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:05,898 INFO L225 Difference]: With dead ends: 933 [2024-10-14 03:56:05,898 INFO L226 Difference]: Without dead ends: 823 [2024-10-14 03:56:05,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:05,899 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1402 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:05,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 2278 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-14 03:56:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 333. [2024-10-14 03:56:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.3312693498452013) internal successors, (430), 332 states have internal predecessors, (430), 0 states have call successors, (0), 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-10-14 03:56:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 430 transitions. [2024-10-14 03:56:05,908 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 430 transitions. Word has length 65 [2024-10-14 03:56:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:05,908 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 430 transitions. [2024-10-14 03:56:05,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 430 transitions. [2024-10-14 03:56:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:05,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:05,909 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] [2024-10-14 03:56:05,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:56:05,910 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1992368467, now seen corresponding path program 1 times [2024-10-14 03:56:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208529945] [2024-10-14 03:56:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208529945] [2024-10-14 03:56:06,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208529945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102465557] [2024-10-14 03:56:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:06,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:06,530 INFO L87 Difference]: Start difference. First operand 333 states and 430 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:07,072 INFO L93 Difference]: Finished difference Result 966 states and 1313 transitions. [2024-10-14 03:56:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:07,075 INFO L225 Difference]: With dead ends: 966 [2024-10-14 03:56:07,075 INFO L226 Difference]: Without dead ends: 849 [2024-10-14 03:56:07,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:07,076 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1947 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1947 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1947 Valid, 2130 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-14 03:56:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 322. [2024-10-14 03:56:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 313 states have (on average 1.329073482428115) internal successors, (416), 321 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-14 03:56:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 416 transitions. [2024-10-14 03:56:07,085 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 416 transitions. Word has length 65 [2024-10-14 03:56:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 416 transitions. [2024-10-14 03:56:07,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 416 transitions. [2024-10-14 03:56:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:07,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:07,087 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] [2024-10-14 03:56:07,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:56:07,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:07,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1545464944, now seen corresponding path program 1 times [2024-10-14 03:56:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405283978] [2024-10-14 03:56:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:08,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405283978] [2024-10-14 03:56:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405283978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-10-14 03:56:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536870517] [2024-10-14 03:56:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 03:56:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 03:56:08,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:08,530 INFO L87 Difference]: Start difference. First operand 322 states and 416 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:11,264 INFO L93 Difference]: Finished difference Result 776 states and 1049 transitions. [2024-10-14 03:56:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 03:56:11,264 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:11,266 INFO L225 Difference]: With dead ends: 776 [2024-10-14 03:56:11,266 INFO L226 Difference]: Without dead ends: 667 [2024-10-14 03:56:11,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 03:56:11,268 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1968 mSDsluCounter, 5978 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 6419 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:11,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 6419 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:56:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-14 03:56:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 322. [2024-10-14 03:56:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 313 states have (on average 1.3258785942492013) internal successors, (415), 321 states have internal predecessors, (415), 0 states have call successors, (0), 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-10-14 03:56:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 415 transitions. [2024-10-14 03:56:11,278 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 415 transitions. Word has length 65 [2024-10-14 03:56:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 415 transitions. [2024-10-14 03:56:11,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 415 transitions. [2024-10-14 03:56:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:11,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:11,280 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] [2024-10-14 03:56:11,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:56:11,280 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2139372300, now seen corresponding path program 1 times [2024-10-14 03:56:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950674671] [2024-10-14 03:56:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950674671] [2024-10-14 03:56:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950674671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941831461] [2024-10-14 03:56:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:11,781 INFO L87 Difference]: Start difference. First operand 322 states and 415 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:12,332 INFO L93 Difference]: Finished difference Result 620 states and 840 transitions. [2024-10-14 03:56:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:56:12,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:12,334 INFO L225 Difference]: With dead ends: 620 [2024-10-14 03:56:12,334 INFO L226 Difference]: Without dead ends: 490 [2024-10-14 03:56:12,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:56:12,335 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 723 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:12,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2553 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-14 03:56:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 298. [2024-10-14 03:56:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 290 states have (on average 1.3310344827586207) internal successors, (386), 297 states have internal predecessors, (386), 0 states have call successors, (0), 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-10-14 03:56:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 386 transitions. [2024-10-14 03:56:12,341 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 386 transitions. Word has length 65 [2024-10-14 03:56:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:12,342 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 386 transitions. [2024-10-14 03:56:12,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 386 transitions. [2024-10-14 03:56:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:12,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:12,343 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] [2024-10-14 03:56:12,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:56:12,343 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1614163178, now seen corresponding path program 1 times [2024-10-14 03:56:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979362580] [2024-10-14 03:56:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979362580] [2024-10-14 03:56:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979362580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177956924] [2024-10-14 03:56:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:12,815 INFO L87 Difference]: Start difference. First operand 298 states and 386 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:13,567 INFO L93 Difference]: Finished difference Result 860 states and 1165 transitions. [2024-10-14 03:56:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:56:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:13,569 INFO L225 Difference]: With dead ends: 860 [2024-10-14 03:56:13,569 INFO L226 Difference]: Without dead ends: 748 [2024-10-14 03:56:13,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:56:13,571 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1258 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:13,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1981 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-14 03:56:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 288. [2024-10-14 03:56:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 281 states have (on average 1.3202846975088969) internal successors, (371), 287 states have internal predecessors, (371), 0 states have call successors, (0), 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-10-14 03:56:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 371 transitions. [2024-10-14 03:56:13,580 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 371 transitions. Word has length 65 [2024-10-14 03:56:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 371 transitions. [2024-10-14 03:56:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 371 transitions. [2024-10-14 03:56:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:13,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:13,582 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] [2024-10-14 03:56:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:56:13,583 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 234306004, now seen corresponding path program 1 times [2024-10-14 03:56:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912969098] [2024-10-14 03:56:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912969098] [2024-10-14 03:56:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912969098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:14,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:14,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819117036] [2024-10-14 03:56:14,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:14,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:14,136 INFO L87 Difference]: Start difference. First operand 288 states and 371 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:14,745 INFO L93 Difference]: Finished difference Result 576 states and 781 transitions. [2024-10-14 03:56:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:56:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:56:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:14,746 INFO L225 Difference]: With dead ends: 576 [2024-10-14 03:56:14,747 INFO L226 Difference]: Without dead ends: 428 [2024-10-14 03:56:14,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:56:14,748 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 590 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:14,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 2474 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-14 03:56:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 246. [2024-10-14 03:56:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 242 states have (on average 1.3181818181818181) internal successors, (319), 245 states have internal predecessors, (319), 0 states have call successors, (0), 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-10-14 03:56:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 319 transitions. [2024-10-14 03:56:14,753 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 319 transitions. Word has length 65 [2024-10-14 03:56:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:14,753 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 319 transitions. [2024-10-14 03:56:14,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 319 transitions. [2024-10-14 03:56:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:56:14,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:14,754 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] [2024-10-14 03:56:14,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:56:14,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:14,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1710848008, now seen corresponding path program 1 times [2024-10-14 03:56:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:14,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855867880] [2024-10-14 03:56:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855867880] [2024-10-14 03:56:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855867880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:56:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625170240] [2024-10-14 03:56:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:56:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:56:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:56:15,099 INFO L87 Difference]: Start difference. First operand 246 states and 319 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:15,690 INFO L93 Difference]: Finished difference Result 689 states and 953 transitions. [2024-10-14 03:56:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:56:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:15,693 INFO L225 Difference]: With dead ends: 689 [2024-10-14 03:56:15,693 INFO L226 Difference]: Without dead ends: 682 [2024-10-14 03:56:15,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:15,694 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 2288 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 573 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-14 03:56:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 250. [2024-10-14 03:56:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.3130081300813008) internal successors, (323), 249 states have internal predecessors, (323), 0 states have call successors, (0), 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-10-14 03:56:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 323 transitions. [2024-10-14 03:56:15,702 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 323 transitions. Word has length 66 [2024-10-14 03:56:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:15,702 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 323 transitions. [2024-10-14 03:56:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 323 transitions. [2024-10-14 03:56:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:56:15,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:15,703 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] [2024-10-14 03:56:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:56:15,704 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -785038328, now seen corresponding path program 1 times [2024-10-14 03:56:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700975667] [2024-10-14 03:56:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700975667] [2024-10-14 03:56:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700975667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419496939] [2024-10-14 03:56:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:15,913 INFO L87 Difference]: Start difference. First operand 250 states and 323 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:16,249 INFO L93 Difference]: Finished difference Result 409 states and 540 transitions. [2024-10-14 03:56:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:56:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:16,251 INFO L225 Difference]: With dead ends: 409 [2024-10-14 03:56:16,251 INFO L226 Difference]: Without dead ends: 402 [2024-10-14 03:56:16,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:16,252 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 438 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:16,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 680 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-14 03:56:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 250. [2024-10-14 03:56:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.3089430894308942) internal successors, (322), 249 states have internal predecessors, (322), 0 states have call successors, (0), 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-10-14 03:56:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2024-10-14 03:56:16,259 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 66 [2024-10-14 03:56:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2024-10-14 03:56:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2024-10-14 03:56:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:56:16,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:16,260 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] [2024-10-14 03:56:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:56:16,261 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1670965080, now seen corresponding path program 1 times [2024-10-14 03:56:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926638011] [2024-10-14 03:56:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926638011] [2024-10-14 03:56:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926638011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:16,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:16,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:56:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734616117] [2024-10-14 03:56:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:16,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:56:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:56:16,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:56:16,588 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:17,391 INFO L93 Difference]: Finished difference Result 936 states and 1306 transitions. [2024-10-14 03:56:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 03:56:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:17,394 INFO L225 Difference]: With dead ends: 936 [2024-10-14 03:56:17,394 INFO L226 Difference]: Without dead ends: 800 [2024-10-14 03:56:17,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:17,395 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1722 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:17,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 1144 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-10-14 03:56:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 258. [2024-10-14 03:56:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 257 states have internal predecessors, (330), 0 states have call successors, (0), 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-10-14 03:56:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 330 transitions. [2024-10-14 03:56:17,402 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 330 transitions. Word has length 66 [2024-10-14 03:56:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:17,402 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 330 transitions. [2024-10-14 03:56:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 330 transitions. [2024-10-14 03:56:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:56:17,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:17,404 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] [2024-10-14 03:56:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:56:17,404 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -866093357, now seen corresponding path program 1 times [2024-10-14 03:56:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451930409] [2024-10-14 03:56:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:17,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451930409] [2024-10-14 03:56:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451930409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479973160] [2024-10-14 03:56:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:17,599 INFO L87 Difference]: Start difference. First operand 258 states and 330 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:17,945 INFO L93 Difference]: Finished difference Result 417 states and 547 transitions. [2024-10-14 03:56:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:17,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 03:56:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:17,947 INFO L225 Difference]: With dead ends: 417 [2024-10-14 03:56:17,947 INFO L226 Difference]: Without dead ends: 410 [2024-10-14 03:56:17,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:17,948 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 539 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:17,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 531 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-14 03:56:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 254. [2024-10-14 03:56:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.3) internal successors, (325), 253 states have internal predecessors, (325), 0 states have call successors, (0), 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-10-14 03:56:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 325 transitions. [2024-10-14 03:56:17,953 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 325 transitions. Word has length 67 [2024-10-14 03:56:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 325 transitions. [2024-10-14 03:56:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 325 transitions. [2024-10-14 03:56:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:56:17,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:17,955 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] [2024-10-14 03:56:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:56:17,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1612547898, now seen corresponding path program 1 times [2024-10-14 03:56:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005511748] [2024-10-14 03:56:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005511748] [2024-10-14 03:56:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005511748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:56:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875216760] [2024-10-14 03:56:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:18,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:56:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:56:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:56:18,333 INFO L87 Difference]: Start difference. First operand 254 states and 325 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:19,025 INFO L93 Difference]: Finished difference Result 568 states and 762 transitions. [2024-10-14 03:56:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:56:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 03:56:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:19,027 INFO L225 Difference]: With dead ends: 568 [2024-10-14 03:56:19,027 INFO L226 Difference]: Without dead ends: 432 [2024-10-14 03:56:19,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:19,028 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 393 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:19,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1492 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-14 03:56:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 246. [2024-10-14 03:56:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 245 states have internal predecessors, (315), 0 states have call successors, (0), 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-10-14 03:56:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 315 transitions. [2024-10-14 03:56:19,033 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 315 transitions. Word has length 67 [2024-10-14 03:56:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:19,034 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 315 transitions. [2024-10-14 03:56:19,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 315 transitions. [2024-10-14 03:56:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:56:19,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:19,035 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] [2024-10-14 03:56:19,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:56:19,035 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 568525784, now seen corresponding path program 1 times [2024-10-14 03:56:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202650991] [2024-10-14 03:56:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202650991] [2024-10-14 03:56:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202650991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:56:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318389725] [2024-10-14 03:56:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:56:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:56:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:56:19,398 INFO L87 Difference]: Start difference. First operand 246 states and 315 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:19,653 INFO L93 Difference]: Finished difference Result 374 states and 496 transitions. [2024-10-14 03:56:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:56:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 03:56:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:19,655 INFO L225 Difference]: With dead ends: 374 [2024-10-14 03:56:19,655 INFO L226 Difference]: Without dead ends: 350 [2024-10-14 03:56:19,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:56:19,656 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 882 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:19,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 628 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-14 03:56:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 222. [2024-10-14 03:56:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 221 states have internal predecessors, (288), 0 states have call successors, (0), 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-10-14 03:56:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2024-10-14 03:56:19,662 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 68 [2024-10-14 03:56:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:19,663 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2024-10-14 03:56:19,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2024-10-14 03:56:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:56:19,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:19,664 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] [2024-10-14 03:56:19,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:56:19,665 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:19,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 207320224, now seen corresponding path program 1 times [2024-10-14 03:56:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25098495] [2024-10-14 03:56:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25098495] [2024-10-14 03:56:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25098495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880196421] [2024-10-14 03:56:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:20,103 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:20,641 INFO L93 Difference]: Finished difference Result 602 states and 835 transitions. [2024-10-14 03:56:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 03:56:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:20,643 INFO L225 Difference]: With dead ends: 602 [2024-10-14 03:56:20,643 INFO L226 Difference]: Without dead ends: 596 [2024-10-14 03:56:20,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:20,644 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1074 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:20,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1625 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-14 03:56:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 216. [2024-10-14 03:56:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 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-10-14 03:56:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 281 transitions. [2024-10-14 03:56:20,655 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 281 transitions. Word has length 68 [2024-10-14 03:56:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 281 transitions. [2024-10-14 03:56:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 281 transitions. [2024-10-14 03:56:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:56:20,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:20,657 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] [2024-10-14 03:56:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:56:20,658 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1386499272, now seen corresponding path program 1 times [2024-10-14 03:56:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894410495] [2024-10-14 03:56:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894410495] [2024-10-14 03:56:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894410495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:21,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-14 03:56:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241188607] [2024-10-14 03:56:21,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:56:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:56:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:56:21,650 INFO L87 Difference]: Start difference. First operand 216 states and 281 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:22,798 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2024-10-14 03:56:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 03:56:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 03:56:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:22,800 INFO L225 Difference]: With dead ends: 366 [2024-10-14 03:56:22,800 INFO L226 Difference]: Without dead ends: 358 [2024-10-14 03:56:22,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 03:56:22,801 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 426 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:22,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2730 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:56:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-14 03:56:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 225. [2024-10-14 03:56:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 1.3094170403587444) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-14 03:56:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2024-10-14 03:56:22,805 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 68 [2024-10-14 03:56:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:22,809 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2024-10-14 03:56:22,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2024-10-14 03:56:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:56:22,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:22,810 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] [2024-10-14 03:56:22,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:56:22,810 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:22,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1979676551, now seen corresponding path program 1 times [2024-10-14 03:56:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393925830] [2024-10-14 03:56:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:22,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393925830] [2024-10-14 03:56:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393925830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438995873] [2024-10-14 03:56:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:23,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:23,316 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:24,034 INFO L93 Difference]: Finished difference Result 627 states and 870 transitions. [2024-10-14 03:56:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 03:56:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:24,036 INFO L225 Difference]: With dead ends: 627 [2024-10-14 03:56:24,036 INFO L226 Difference]: Without dead ends: 612 [2024-10-14 03:56:24,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:56:24,037 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 846 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:24,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 2646 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-14 03:56:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 204. [2024-10-14 03:56:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 203 states have internal predecessors, (267), 0 states have call successors, (0), 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-10-14 03:56:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2024-10-14 03:56:24,043 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 69 [2024-10-14 03:56:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:24,043 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2024-10-14 03:56:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2024-10-14 03:56:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:56:24,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:24,045 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-10-14 03:56:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:56:24,045 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:24,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1973108893, now seen corresponding path program 1 times [2024-10-14 03:56:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26555062] [2024-10-14 03:56:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26555062] [2024-10-14 03:56:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26555062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985869586] [2024-10-14 03:56:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:24,148 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-10-14 03:56:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:24,247 INFO L93 Difference]: Finished difference Result 1052 states and 1547 transitions. [2024-10-14 03:56:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:56:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-10-14 03:56:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:24,250 INFO L225 Difference]: With dead ends: 1052 [2024-10-14 03:56:24,250 INFO L226 Difference]: Without dead ends: 946 [2024-10-14 03:56:24,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:56:24,251 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 905 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:24,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 959 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-14 03:56:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 308. [2024-10-14 03:56:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.3745928338762214) internal successors, (422), 307 states have internal predecessors, (422), 0 states have call successors, (0), 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-10-14 03:56:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 422 transitions. [2024-10-14 03:56:24,258 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 422 transitions. Word has length 91 [2024-10-14 03:56:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:24,258 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 422 transitions. [2024-10-14 03:56:24,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-10-14 03:56:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 422 transitions. [2024-10-14 03:56:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:56:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:24,260 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-10-14 03:56:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:56:24,260 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -849862238, now seen corresponding path program 1 times [2024-10-14 03:56:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837858964] [2024-10-14 03:56:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837858964] [2024-10-14 03:56:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837858964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:24,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:24,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425658432] [2024-10-14 03:56:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:24,366 INFO L87 Difference]: Start difference. First operand 308 states and 422 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:24,452 INFO L93 Difference]: Finished difference Result 1254 states and 1838 transitions. [2024-10-14 03:56:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:24,456 INFO L225 Difference]: With dead ends: 1254 [2024-10-14 03:56:24,456 INFO L226 Difference]: Without dead ends: 1044 [2024-10-14 03:56:24,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:24,457 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 653 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 677 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-10-14 03:56:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 516. [2024-10-14 03:56:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4252427184466019) internal successors, (734), 515 states have internal predecessors, (734), 0 states have call successors, (0), 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-10-14 03:56:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2024-10-14 03:56:24,467 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 93 [2024-10-14 03:56:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:24,468 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2024-10-14 03:56:24,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2024-10-14 03:56:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:56:24,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:24,469 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-10-14 03:56:24,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:56:24,471 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1784168805, now seen corresponding path program 1 times [2024-10-14 03:56:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354703849] [2024-10-14 03:56:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:24,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354703849] [2024-10-14 03:56:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354703849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318578208] [2024-10-14 03:56:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:24,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:24,642 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:24,728 INFO L93 Difference]: Finished difference Result 936 states and 1362 transitions. [2024-10-14 03:56:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:24,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:24,730 INFO L225 Difference]: With dead ends: 936 [2024-10-14 03:56:24,730 INFO L226 Difference]: Without dead ends: 518 [2024-10-14 03:56:24,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:24,731 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 76 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:24,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 458 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-14 03:56:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2024-10-14 03:56:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4174757281553398) internal successors, (730), 515 states have internal predecessors, (730), 0 states have call successors, (0), 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-10-14 03:56:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2024-10-14 03:56:24,740 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 93 [2024-10-14 03:56:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:24,740 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2024-10-14 03:56:24,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2024-10-14 03:56:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:56:24,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:24,742 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-10-14 03:56:24,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:56:24,742 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1044428484, now seen corresponding path program 1 times [2024-10-14 03:56:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641116552] [2024-10-14 03:56:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641116552] [2024-10-14 03:56:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641116552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727246931] [2024-10-14 03:56:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:24,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:24,793 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 03:56:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:24,821 INFO L93 Difference]: Finished difference Result 1300 states and 1888 transitions. [2024-10-14 03:56:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 03:56:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:24,824 INFO L225 Difference]: With dead ends: 1300 [2024-10-14 03:56:24,824 INFO L226 Difference]: Without dead ends: 882 [2024-10-14 03:56:24,825 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-10-14 03:56:24,825 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 90 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:24,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 251 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-14 03:56:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2024-10-14 03:56:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.4190585533869116) internal successors, (1236), 871 states have internal predecessors, (1236), 0 states have call successors, (0), 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-10-14 03:56:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1236 transitions. [2024-10-14 03:56:24,837 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1236 transitions. Word has length 93 [2024-10-14 03:56:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1236 transitions. [2024-10-14 03:56:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 03:56:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1236 transitions. [2024-10-14 03:56:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:56:24,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:24,839 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-10-14 03:56:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:56:24,839 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 136983470, now seen corresponding path program 1 times [2024-10-14 03:56:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021210201] [2024-10-14 03:56:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021210201] [2024-10-14 03:56:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021210201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368549403] [2024-10-14 03:56:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:24,935 INFO L87 Difference]: Start difference. First operand 872 states and 1236 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:25,022 INFO L93 Difference]: Finished difference Result 2620 states and 3785 transitions. [2024-10-14 03:56:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:25,027 INFO L225 Difference]: With dead ends: 2620 [2024-10-14 03:56:25,027 INFO L226 Difference]: Without dead ends: 2232 [2024-10-14 03:56:25,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:25,029 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 621 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:25,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 688 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2024-10-14 03:56:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1452. [2024-10-14 03:56:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4321157822191593) internal successors, (2078), 1451 states have internal predecessors, (2078), 0 states have call successors, (0), 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-10-14 03:56:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2078 transitions. [2024-10-14 03:56:25,051 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2078 transitions. Word has length 93 [2024-10-14 03:56:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2078 transitions. [2024-10-14 03:56:25,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2078 transitions. [2024-10-14 03:56:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:56:25,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:25,053 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-10-14 03:56:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:56:25,053 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash -982436120, now seen corresponding path program 1 times [2024-10-14 03:56:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239037872] [2024-10-14 03:56:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239037872] [2024-10-14 03:56:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239037872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412500347] [2024-10-14 03:56:25,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:25,156 INFO L87 Difference]: Start difference. First operand 1452 states and 2078 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:25,252 INFO L93 Difference]: Finished difference Result 3006 states and 4347 transitions. [2024-10-14 03:56:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:25,260 INFO L225 Difference]: With dead ends: 3006 [2024-10-14 03:56:25,260 INFO L226 Difference]: Without dead ends: 2618 [2024-10-14 03:56:25,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:25,262 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 587 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:25,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 753 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2024-10-14 03:56:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1838. [2024-10-14 03:56:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.437125748502994) internal successors, (2640), 1837 states have internal predecessors, (2640), 0 states have call successors, (0), 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-10-14 03:56:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2640 transitions. [2024-10-14 03:56:25,310 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2640 transitions. Word has length 93 [2024-10-14 03:56:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:25,310 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2640 transitions. [2024-10-14 03:56:25,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-10-14 03:56:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2640 transitions. [2024-10-14 03:56:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:56:25,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:25,312 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] [2024-10-14 03:56:25,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:56:25,312 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:25,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash -584509439, now seen corresponding path program 1 times [2024-10-14 03:56:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845811586] [2024-10-14 03:56:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845811586] [2024-10-14 03:56:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845811586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:25,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746690098] [2024-10-14 03:56:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:25,400 INFO L87 Difference]: Start difference. First operand 1838 states and 2640 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:25,428 INFO L93 Difference]: Finished difference Result 5174 states and 7454 transitions. [2024-10-14 03:56:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-14 03:56:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:25,445 INFO L225 Difference]: With dead ends: 5174 [2024-10-14 03:56:25,446 INFO L226 Difference]: Without dead ends: 3434 [2024-10-14 03:56:25,453 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-10-14 03:56:25,453 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 73 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:25,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2024-10-14 03:56:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3288. [2024-10-14 03:56:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.431092181320353) internal successors, (4704), 3287 states have internal predecessors, (4704), 0 states have call successors, (0), 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-10-14 03:56:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4704 transitions. [2024-10-14 03:56:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4704 transitions. Word has length 94 [2024-10-14 03:56:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 4704 transitions. [2024-10-14 03:56:25,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4704 transitions. [2024-10-14 03:56:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:56:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:25,500 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] [2024-10-14 03:56:25,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:56:25,500 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1030240199, now seen corresponding path program 1 times [2024-10-14 03:56:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641226879] [2024-10-14 03:56:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641226879] [2024-10-14 03:56:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641226879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494728864] [2024-10-14 03:56:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:25,587 INFO L87 Difference]: Start difference. First operand 3288 states and 4704 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-10-14 03:56:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:25,623 INFO L93 Difference]: Finished difference Result 9380 states and 13394 transitions. [2024-10-14 03:56:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:25,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-14 03:56:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:25,637 INFO L225 Difference]: With dead ends: 9380 [2024-10-14 03:56:25,637 INFO L226 Difference]: Without dead ends: 6190 [2024-10-14 03:56:25,642 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-10-14 03:56:25,643 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:25,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2024-10-14 03:56:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 5900. [2024-10-14 03:56:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5900 states, 5899 states have (on average 1.4178674351585014) internal successors, (8364), 5899 states have internal predecessors, (8364), 0 states have call successors, (0), 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-10-14 03:56:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 8364 transitions. [2024-10-14 03:56:25,731 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 8364 transitions. Word has length 95 [2024-10-14 03:56:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:25,731 INFO L471 AbstractCegarLoop]: Abstraction has 5900 states and 8364 transitions. [2024-10-14 03:56:25,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-10-14 03:56:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 8364 transitions. [2024-10-14 03:56:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 03:56:25,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:25,733 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-10-14 03:56:25,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:56:25,733 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:25,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash -176722336, now seen corresponding path program 1 times [2024-10-14 03:56:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436364343] [2024-10-14 03:56:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436364343] [2024-10-14 03:56:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436364343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:25,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613739631] [2024-10-14 03:56:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:25,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:25,818 INFO L87 Difference]: Start difference. First operand 5900 states and 8364 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-10-14 03:56:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:25,895 INFO L93 Difference]: Finished difference Result 16928 states and 23870 transitions. [2024-10-14 03:56:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:25,896 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-10-14 03:56:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:25,912 INFO L225 Difference]: With dead ends: 16928 [2024-10-14 03:56:25,912 INFO L226 Difference]: Without dead ends: 11126 [2024-10-14 03:56:25,917 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-10-14 03:56:25,918 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 56 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:25,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11126 states. [2024-10-14 03:56:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11126 to 10548. [2024-10-14 03:56:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 1.3983123162984734) internal successors, (14748), 10547 states have internal predecessors, (14748), 0 states have call successors, (0), 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-10-14 03:56:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14748 transitions. [2024-10-14 03:56:26,039 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14748 transitions. Word has length 96 [2024-10-14 03:56:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:26,040 INFO L471 AbstractCegarLoop]: Abstraction has 10548 states and 14748 transitions. [2024-10-14 03:56:26,040 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-10-14 03:56:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14748 transitions. [2024-10-14 03:56:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:56:26,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:26,041 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] [2024-10-14 03:56:26,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:56:26,041 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -760726548, now seen corresponding path program 1 times [2024-10-14 03:56:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679336569] [2024-10-14 03:56:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679336569] [2024-10-14 03:56:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679336569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757685638] [2024-10-14 03:56:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:26,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:26,241 INFO L87 Difference]: Start difference. First operand 10548 states and 14748 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:26,612 INFO L93 Difference]: Finished difference Result 31774 states and 44360 transitions. [2024-10-14 03:56:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:56:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:26,654 INFO L225 Difference]: With dead ends: 31774 [2024-10-14 03:56:26,655 INFO L226 Difference]: Without dead ends: 21312 [2024-10-14 03:56:26,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:26,672 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 324 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:26,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 592 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21312 states. [2024-10-14 03:56:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21312 to 10548. [2024-10-14 03:56:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 1.3981226889162794) internal successors, (14746), 10547 states have internal predecessors, (14746), 0 states have call successors, (0), 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-10-14 03:56:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14746 transitions. [2024-10-14 03:56:26,977 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14746 transitions. Word has length 97 [2024-10-14 03:56:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:26,978 INFO L471 AbstractCegarLoop]: Abstraction has 10548 states and 14746 transitions. [2024-10-14 03:56:26,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14746 transitions. [2024-10-14 03:56:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:56:26,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:26,979 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-10-14 03:56:26,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 03:56:26,980 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:26,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1919987110, now seen corresponding path program 1 times [2024-10-14 03:56:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071842530] [2024-10-14 03:56:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071842530] [2024-10-14 03:56:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071842530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:27,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646067935] [2024-10-14 03:56:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:27,210 INFO L87 Difference]: Start difference. First operand 10548 states and 14746 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:27,258 INFO L93 Difference]: Finished difference Result 10934 states and 15259 transitions. [2024-10-14 03:56:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:27,275 INFO L225 Difference]: With dead ends: 10934 [2024-10-14 03:56:27,275 INFO L226 Difference]: Without dead ends: 10932 [2024-10-14 03:56:27,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:27,280 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:27,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2024-10-14 03:56:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 10932. [2024-10-14 03:56:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10932 states, 10931 states have (on average 1.3768182234013358) internal successors, (15050), 10931 states have internal predecessors, (15050), 0 states have call successors, (0), 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-10-14 03:56:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10932 states to 10932 states and 15050 transitions. [2024-10-14 03:56:27,401 INFO L78 Accepts]: Start accepts. Automaton has 10932 states and 15050 transitions. Word has length 99 [2024-10-14 03:56:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:27,401 INFO L471 AbstractCegarLoop]: Abstraction has 10932 states and 15050 transitions. [2024-10-14 03:56:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10932 states and 15050 transitions. [2024-10-14 03:56:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:56:27,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:27,402 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-10-14 03:56:27,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:56:27,403 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash -921361998, now seen corresponding path program 1 times [2024-10-14 03:56:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846419991] [2024-10-14 03:56:27,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:27,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846419991] [2024-10-14 03:56:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846419991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:27,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782339257] [2024-10-14 03:56:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:56:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:56:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:56:27,537 INFO L87 Difference]: Start difference. First operand 10932 states and 15050 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:27,643 INFO L93 Difference]: Finished difference Result 20606 states and 28495 transitions. [2024-10-14 03:56:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:56:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:27,665 INFO L225 Difference]: With dead ends: 20606 [2024-10-14 03:56:27,665 INFO L226 Difference]: Without dead ends: 18188 [2024-10-14 03:56:27,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:56:27,675 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 644 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:27,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 744 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18188 states. [2024-10-14 03:56:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18188 to 13348. [2024-10-14 03:56:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13348 states, 13347 states have (on average 1.3769386378961563) internal successors, (18378), 13347 states have internal predecessors, (18378), 0 states have call successors, (0), 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-10-14 03:56:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13348 states to 13348 states and 18378 transitions. [2024-10-14 03:56:27,854 INFO L78 Accepts]: Start accepts. Automaton has 13348 states and 18378 transitions. Word has length 99 [2024-10-14 03:56:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:27,855 INFO L471 AbstractCegarLoop]: Abstraction has 13348 states and 18378 transitions. [2024-10-14 03:56:27,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-10-14 03:56:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13348 states and 18378 transitions. [2024-10-14 03:56:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:56:27,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:27,856 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, 1] [2024-10-14 03:56:27,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:56:27,856 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:27,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1329909795, now seen corresponding path program 1 times [2024-10-14 03:56:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393584535] [2024-10-14 03:56:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:27,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393584535] [2024-10-14 03:56:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393584535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:27,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311331329] [2024-10-14 03:56:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:27,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:27,968 INFO L87 Difference]: Start difference. First operand 13348 states and 18378 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-14 03:56:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:28,054 INFO L93 Difference]: Finished difference Result 34744 states and 47780 transitions. [2024-10-14 03:56:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-14 03:56:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:28,081 INFO L225 Difference]: With dead ends: 34744 [2024-10-14 03:56:28,081 INFO L226 Difference]: Without dead ends: 21494 [2024-10-14 03:56:28,097 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-10-14 03:56:28,098 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 74 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:28,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21494 states. [2024-10-14 03:56:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21494 to 20084. [2024-10-14 03:56:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3552756062341285) internal successors, (27218), 20083 states have internal predecessors, (27218), 0 states have call successors, (0), 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-10-14 03:56:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 27218 transitions. [2024-10-14 03:56:28,389 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 27218 transitions. Word has length 100 [2024-10-14 03:56:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:28,390 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 27218 transitions. [2024-10-14 03:56:28,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-14 03:56:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 27218 transitions. [2024-10-14 03:56:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 03:56:28,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:28,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:56:28,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:56:28,395 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:28,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -685239100, now seen corresponding path program 1 times [2024-10-14 03:56:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825162051] [2024-10-14 03:56:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825162051] [2024-10-14 03:56:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825162051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:28,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:28,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:56:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016888028] [2024-10-14 03:56:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:56:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:56:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:56:28,489 INFO L87 Difference]: Start difference. First operand 20084 states and 27218 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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-10-14 03:56:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:28,581 INFO L93 Difference]: Finished difference Result 40072 states and 54332 transitions. [2024-10-14 03:56:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:56:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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 126 [2024-10-14 03:56:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:28,604 INFO L225 Difference]: With dead ends: 40072 [2024-10-14 03:56:28,604 INFO L226 Difference]: Without dead ends: 20086 [2024-10-14 03:56:28,623 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-10-14 03:56:28,626 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:28,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:56:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20086 states. [2024-10-14 03:56:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20086 to 20084. [2024-10-14 03:56:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3377483443708609) internal successors, (26866), 20083 states have internal predecessors, (26866), 0 states have call successors, (0), 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-10-14 03:56:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 26866 transitions. [2024-10-14 03:56:28,956 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 26866 transitions. Word has length 126 [2024-10-14 03:56:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 26866 transitions. [2024-10-14 03:56:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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-10-14 03:56:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 26866 transitions. [2024-10-14 03:56:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 03:56:29,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:29,073 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] [2024-10-14 03:56:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 03:56:29,075 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 861961694, now seen corresponding path program 1 times [2024-10-14 03:56:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870955270] [2024-10-14 03:56:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870955270] [2024-10-14 03:56:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870955270] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797655424] [2024-10-14 03:56:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:29,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:29,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:29,704 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-10-14 03:56:29,705 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-10-14 03:56:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:29,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 03:56:29,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:30,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797655424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:32,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-10-14 03:56:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290663111] [2024-10-14 03:56:32,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:56:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:56:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:56:32,488 INFO L87 Difference]: Start difference. First operand 20084 states and 26866 transitions. Second operand has 27 states, 27 states have (on average 11.333333333333334) internal successors, (306), 26 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:34,968 INFO L93 Difference]: Finished difference Result 99998 states and 133710 transitions. [2024-10-14 03:56:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-14 03:56:34,968 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.333333333333334) internal successors, (306), 26 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-10-14 03:56:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:35,060 INFO L225 Difference]: With dead ends: 99998 [2024-10-14 03:56:35,060 INFO L226 Difference]: Without dead ends: 80012 [2024-10-14 03:56:35,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=754, Invalid=3536, Unknown=0, NotChecked=0, Total=4290 [2024-10-14 03:56:35,097 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 2225 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:35,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 2826 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:56:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80012 states. [2024-10-14 03:56:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80012 to 33872. [2024-10-14 03:56:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33872 states, 33871 states have (on average 1.3308730182161732) internal successors, (45078), 33871 states have internal predecessors, (45078), 0 states have call successors, (0), 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-10-14 03:56:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33872 states to 33872 states and 45078 transitions. [2024-10-14 03:56:35,778 INFO L78 Accepts]: Start accepts. Automaton has 33872 states and 45078 transitions. Word has length 126 [2024-10-14 03:56:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:35,778 INFO L471 AbstractCegarLoop]: Abstraction has 33872 states and 45078 transitions. [2024-10-14 03:56:35,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.333333333333334) internal successors, (306), 26 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33872 states and 45078 transitions. [2024-10-14 03:56:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 03:56:35,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:35,783 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] [2024-10-14 03:56:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:56:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-10-14 03:56:35,984 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 375788274, now seen corresponding path program 1 times [2024-10-14 03:56:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566709180] [2024-10-14 03:56:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:56:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566709180] [2024-10-14 03:56:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566709180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:56:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261404222] [2024-10-14 03:56:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:56:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:56:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:56:36,171 INFO L87 Difference]: Start difference. First operand 33872 states and 45078 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-10-14 03:56:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:36,431 INFO L93 Difference]: Finished difference Result 67308 states and 89640 transitions. [2024-10-14 03:56:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:56:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 127 [2024-10-14 03:56:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:36,490 INFO L225 Difference]: With dead ends: 67308 [2024-10-14 03:56:36,490 INFO L226 Difference]: Without dead ends: 47322 [2024-10-14 03:56:36,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:56:36,514 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 102 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:36,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 279 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47322 states. [2024-10-14 03:56:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47322 to 33696. [2024-10-14 03:56:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33696 states, 33695 states have (on average 1.3273779492506306) internal successors, (44726), 33695 states have internal predecessors, (44726), 0 states have call successors, (0), 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-10-14 03:56:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33696 states to 33696 states and 44726 transitions. [2024-10-14 03:56:37,008 INFO L78 Accepts]: Start accepts. Automaton has 33696 states and 44726 transitions. Word has length 127 [2024-10-14 03:56:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:37,008 INFO L471 AbstractCegarLoop]: Abstraction has 33696 states and 44726 transitions. [2024-10-14 03:56:37,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-10-14 03:56:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33696 states and 44726 transitions. [2024-10-14 03:56:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 03:56:37,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:37,013 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] [2024-10-14 03:56:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-14 03:56:37,014 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1289653907, now seen corresponding path program 1 times [2024-10-14 03:56:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935879023] [2024-10-14 03:56:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935879023] [2024-10-14 03:56:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935879023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526265158] [2024-10-14 03:56:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:37,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:56:37,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:56:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:37,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:56:37,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:38,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526265158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:40,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-14 03:56:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854466194] [2024-10-14 03:56:40,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:40,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:56:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:56:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:56:40,146 INFO L87 Difference]: Start difference. First operand 33696 states and 44726 transitions. Second operand has 29 states, 29 states have (on average 11.310344827586206) internal successors, (328), 28 states have internal predecessors, (328), 0 states have call successors, (0), 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-10-14 03:56:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:41,366 INFO L93 Difference]: Finished difference Result 131798 states and 175887 transitions. [2024-10-14 03:56:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:56:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.310344827586206) internal successors, (328), 28 states have internal predecessors, (328), 0 states have call successors, (0), 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 127 [2024-10-14 03:56:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:41,463 INFO L225 Difference]: With dead ends: 131798 [2024-10-14 03:56:41,464 INFO L226 Difference]: Without dead ends: 98200 [2024-10-14 03:56:41,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 03:56:41,489 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1898 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:41,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 1345 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98200 states. [2024-10-14 03:56:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98200 to 80337. [2024-10-14 03:56:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80337 states, 80336 states have (on average 1.3252962557259511) internal successors, (106469), 80336 states have internal predecessors, (106469), 0 states have call successors, (0), 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-10-14 03:56:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80337 states to 80337 states and 106469 transitions. [2024-10-14 03:56:42,444 INFO L78 Accepts]: Start accepts. Automaton has 80337 states and 106469 transitions. Word has length 127 [2024-10-14 03:56:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:42,444 INFO L471 AbstractCegarLoop]: Abstraction has 80337 states and 106469 transitions. [2024-10-14 03:56:42,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.310344827586206) internal successors, (328), 28 states have internal predecessors, (328), 0 states have call successors, (0), 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-10-14 03:56:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 80337 states and 106469 transitions. [2024-10-14 03:56:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 03:56:42,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:42,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:56:42,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:56:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-10-14 03:56:42,653 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:42,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -502073740, now seen corresponding path program 1 times [2024-10-14 03:56:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608012777] [2024-10-14 03:56:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608012777] [2024-10-14 03:56:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608012777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857244325] [2024-10-14 03:56:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:43,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:43,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:56:43,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:56:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:43,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:56:43,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:44,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:45,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857244325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:45,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:45,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-14 03:56:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105542523] [2024-10-14 03:56:45,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:45,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 03:56:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 03:56:45,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:56:45,589 INFO L87 Difference]: Start difference. First operand 80337 states and 106469 transitions. Second operand has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-14 03:56:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:47,250 INFO L93 Difference]: Finished difference Result 335684 states and 447847 transitions. [2024-10-14 03:56:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:56:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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 127 [2024-10-14 03:56:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:47,569 INFO L225 Difference]: With dead ends: 335684 [2024-10-14 03:56:47,570 INFO L226 Difference]: Without dead ends: 255471 [2024-10-14 03:56:47,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2024-10-14 03:56:47,637 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1987 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:47,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1987 Valid, 1231 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255471 states. [2024-10-14 03:56:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255471 to 195994. [2024-10-14 03:56:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195994 states, 195993 states have (on average 1.3223176337930436) internal successors, (259165), 195993 states have internal predecessors, (259165), 0 states have call successors, (0), 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-10-14 03:56:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195994 states to 195994 states and 259165 transitions. [2024-10-14 03:56:51,243 INFO L78 Accepts]: Start accepts. Automaton has 195994 states and 259165 transitions. Word has length 127 [2024-10-14 03:56:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:51,244 INFO L471 AbstractCegarLoop]: Abstraction has 195994 states and 259165 transitions. [2024-10-14 03:56:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-14 03:56:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 195994 states and 259165 transitions. [2024-10-14 03:56:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 03:56:51,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:51,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:56:51,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:56:51,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:51,459 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:51,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1332129653, now seen corresponding path program 1 times [2024-10-14 03:56:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798589375] [2024-10-14 03:56:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:52,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798589375] [2024-10-14 03:56:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798589375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:56:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826420135] [2024-10-14 03:56:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:52,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:56:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:52,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:56:52,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:56:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:52,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:56:52,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:56:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:53,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:56:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826420135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:56:54,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:56:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2024-10-14 03:56:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786226725] [2024-10-14 03:56:54,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:56:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:56:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:56:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:56:54,589 INFO L87 Difference]: Start difference. First operand 195994 states and 259165 transitions. Second operand has 29 states, 29 states have (on average 10.689655172413794) internal successors, (310), 29 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)