/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:31:10,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:31:10,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 06:31:10,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:31:10,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:31:10,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:31:10,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:31:10,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:31:10,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:31:10,225 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:31:10,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:31:10,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:31:10,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:31:10,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:31:10,227 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:31:10,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:31:10,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:31:10,228 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:31:10,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 06:31:10,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:31:10,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:31:10,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:31:10,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:31:10,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:31:10,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:31:10,231 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:31:10,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:31:10,231 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:31:10,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:31:10,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:31:10,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:31:10,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:31:10,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:31:10,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:31:10,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:31:10,235 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:31:10,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:31:10,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:31:10,235 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: Use bitabs translation -> false [2023-12-16 06:31:10,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:31:10,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:31:10,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:31:10,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:31:10,523 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:31:10,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2023-12-16 06:31:11,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:31:12,463 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:31:12,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2023-12-16 06:31:12,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad36db95/0d9c9e0acbe1421994841acdcd6deddb/FLAGeb99d19fb [2023-12-16 06:31:12,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cad36db95/0d9c9e0acbe1421994841acdcd6deddb [2023-12-16 06:31:12,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:31:12,551 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:31:12,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:31:12,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:31:12,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:31:12,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:12" (1/1) ... [2023-12-16 06:31:12,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e6f1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:12, skipping insertion in model container [2023-12-16 06:31:12,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:12" (1/1) ... [2023-12-16 06:31:12,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:31:13,552 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[22358,22371] [2023-12-16 06:31:13,605 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[28268,28281] [2023-12-16 06:31:13,614 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[29690,29703] [2023-12-16 06:31:13,620 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[30548,30561] [2023-12-16 06:31:13,630 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[32341,32354] [2023-12-16 06:31:13,640 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[33199,33212] [2023-12-16 06:31:13,648 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[34428,34441] [2023-12-16 06:31:13,668 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[37283,37296] [2023-12-16 06:31:13,676 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[38144,38157] [2023-12-16 06:31:13,683 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[39376,39389] [2023-12-16 06:31:13,701 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[41667,41680] [2023-12-16 06:31:13,720 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46092,46105] [2023-12-16 06:31:13,726 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46953,46966] [2023-12-16 06:31:13,733 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[48185,48198] [2023-12-16 06:31:13,743 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[50476,50489] [2023-12-16 06:31:13,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[54337,54350] [2023-12-16 06:31:13,788 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[61299,61312] [2023-12-16 06:31:13,794 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[62160,62173] [2023-12-16 06:31:13,801 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[63392,63405] [2023-12-16 06:31:13,811 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[65683,65696] [2023-12-16 06:31:13,827 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[69544,69557] [2023-12-16 06:31:13,853 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[75942,75955] [2023-12-16 06:31:13,941 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[87347,87360] [2023-12-16 06:31:13,948 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[88208,88221] [2023-12-16 06:31:13,955 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[89401,89414] [2023-12-16 06:31:13,966 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[91653,91666] [2023-12-16 06:31:13,990 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[95755,95768] [2023-12-16 06:31:14,028 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[103009,103022] [2023-12-16 06:31:14,079 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[115656,115669] [2023-12-16 06:31:14,170 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[137951,137964] [2023-12-16 06:31:14,176 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[138812,138825] [2023-12-16 06:31:14,182 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[140044,140057] [2023-12-16 06:31:14,194 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[142335,142348] [2023-12-16 06:31:14,210 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[146196,146209] [2023-12-16 06:31:14,234 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[152594,152607] [2023-12-16 06:31:14,290 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[163435,163448] [2023-12-16 06:31:14,452 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[182075,182088] [2023-12-16 06:31:15,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:31:15,816 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:31:15,945 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[22358,22371] [2023-12-16 06:31:15,980 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[28268,28281] [2023-12-16 06:31:15,994 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[29690,29703] [2023-12-16 06:31:16,004 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[30548,30561] [2023-12-16 06:31:16,020 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[32341,32354] [2023-12-16 06:31:16,031 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[33199,33212] [2023-12-16 06:31:16,047 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[34428,34441] [2023-12-16 06:31:16,059 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[37283,37296] [2023-12-16 06:31:16,064 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[38144,38157] [2023-12-16 06:31:16,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[39376,39389] [2023-12-16 06:31:16,078 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[41667,41680] [2023-12-16 06:31:16,092 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46092,46105] [2023-12-16 06:31:16,097 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46953,46966] [2023-12-16 06:31:16,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[48185,48198] [2023-12-16 06:31:16,111 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[50476,50489] [2023-12-16 06:31:16,123 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[54337,54350] [2023-12-16 06:31:16,146 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[61299,61312] [2023-12-16 06:31:16,150 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[62160,62173] [2023-12-16 06:31:16,156 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[63392,63405] [2023-12-16 06:31:16,165 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[65683,65696] [2023-12-16 06:31:16,177 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[69544,69557] [2023-12-16 06:31:16,196 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[75942,75955] [2023-12-16 06:31:16,225 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[87347,87360] [2023-12-16 06:31:16,230 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[88208,88221] [2023-12-16 06:31:16,238 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[89401,89414] [2023-12-16 06:31:16,248 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[91653,91666] [2023-12-16 06:31:16,264 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[95755,95768] [2023-12-16 06:31:16,308 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[103009,103022] [2023-12-16 06:31:16,358 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[115656,115669] [2023-12-16 06:31:16,458 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[137951,137964] [2023-12-16 06:31:16,475 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[138812,138825] [2023-12-16 06:31:16,494 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[140044,140057] [2023-12-16 06:31:16,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[142335,142348] [2023-12-16 06:31:16,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[146196,146209] [2023-12-16 06:31:16,534 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[152594,152607] [2023-12-16 06:31:16,564 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[163435,163448] [2023-12-16 06:31:16,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[182075,182088] [2023-12-16 06:31:17,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:31:17,652 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:31:17,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17 WrapperNode [2023-12-16 06:31:17,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:31:17,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:31:17,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:31:17,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:31:17,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:17,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,119 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25964 [2023-12-16 06:31:18,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:31:18,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:31:18,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:31:18,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:31:18,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,478 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]. [2023-12-16 06:31:18,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:31:18,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:31:18,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:31:18,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:31:18,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (1/1) ... [2023-12-16 06:31:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:31:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:31:18,842 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) [2023-12-16 06:31:18,866 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 [2023-12-16 06:31:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:31:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 06:31:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:31:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:31:19,448 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:31:19,451 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:31:28,085 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:31:28,249 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:31:28,249 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 06:31:28,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:28 BoogieIcfgContainer [2023-12-16 06:31:28,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:31:28,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:31:28,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:31:28,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:31:28,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:31:12" (1/3) ... [2023-12-16 06:31:28,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271d6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:28, skipping insertion in model container [2023-12-16 06:31:28,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:17" (2/3) ... [2023-12-16 06:31:28,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271d6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:28, skipping insertion in model container [2023-12-16 06:31:28,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:28" (3/3) ... [2023-12-16 06:31:28,259 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2023-12-16 06:31:28,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:31:28,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-12-16 06:31:28,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:31:28,437 INFO L357 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, mHoare=true, 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;@1ce36c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:31:28,437 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-12-16 06:31:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 3891 states, 3853 states have (on average 1.866337918505061) internal successors, (7191), 3890 states have internal predecessors, (7191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 06:31:28,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:28,570 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:28,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:28,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 970242633, now seen corresponding path program 1 times [2023-12-16 06:31:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:28,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027347730] [2023-12-16 06:31:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027347730] [2023-12-16 06:31:29,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027347730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:29,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:29,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223246081] [2023-12-16 06:31:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:29,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:29,448 INFO L87 Difference]: Start difference. First operand has 3891 states, 3853 states have (on average 1.866337918505061) internal successors, (7191), 3890 states have internal predecessors, (7191), 0 states have call successors, (0), 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 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:32,224 INFO L93 Difference]: Finished difference Result 5677 states and 10167 transitions. [2023-12-16 06:31:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2023-12-16 06:31:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:32,250 INFO L225 Difference]: With dead ends: 5677 [2023-12-16 06:31:32,250 INFO L226 Difference]: Without dead ends: 3057 [2023-12-16 06:31:32,259 INFO L412 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 [2023-12-16 06:31:32,262 INFO L413 NwaCegarLoop]: 3342 mSDtfsCounter, 16025 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16025 SdHoareTripleChecker+Valid, 3446 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:32,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16025 Valid, 3446 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 06:31:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2023-12-16 06:31:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3057. [2023-12-16 06:31:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 3020 states have (on average 1.3119205298013246) internal successors, (3962), 3056 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 3962 transitions. [2023-12-16 06:31:32,382 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 3962 transitions. Word has length 116 [2023-12-16 06:31:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:32,383 INFO L495 AbstractCegarLoop]: Abstraction has 3057 states and 3962 transitions. [2023-12-16 06:31:32,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 3962 transitions. [2023-12-16 06:31:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 06:31:32,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:32,392 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:32,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 06:31:32,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:32,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash 716802334, now seen corresponding path program 1 times [2023-12-16 06:31:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:32,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628016157] [2023-12-16 06:31:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:32,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628016157] [2023-12-16 06:31:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628016157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141356901] [2023-12-16 06:31:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:32,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:32,700 INFO L87 Difference]: Start difference. First operand 3057 states and 3962 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:34,676 INFO L93 Difference]: Finished difference Result 4837 states and 6520 transitions. [2023-12-16 06:31:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2023-12-16 06:31:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:34,688 INFO L225 Difference]: With dead ends: 4837 [2023-12-16 06:31:34,688 INFO L226 Difference]: Without dead ends: 2461 [2023-12-16 06:31:34,691 INFO L412 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 [2023-12-16 06:31:34,692 INFO L413 NwaCegarLoop]: 1854 mSDtfsCounter, 9807 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9807 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:34,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9807 Valid, 1874 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 06:31:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2023-12-16 06:31:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2023-12-16 06:31:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2424 states have (on average 1.3617986798679869) internal successors, (3301), 2460 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3301 transitions. [2023-12-16 06:31:34,788 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3301 transitions. Word has length 117 [2023-12-16 06:31:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:34,804 INFO L495 AbstractCegarLoop]: Abstraction has 2461 states and 3301 transitions. [2023-12-16 06:31:34,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3301 transitions. [2023-12-16 06:31:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 06:31:34,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:34,819 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 06:31:34,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:34,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1403949894, now seen corresponding path program 1 times [2023-12-16 06:31:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181742645] [2023-12-16 06:31:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181742645] [2023-12-16 06:31:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181742645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:35,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:35,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814350473] [2023-12-16 06:31:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:35,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:35,312 INFO L87 Difference]: Start difference. First operand 2461 states and 3301 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:37,505 INFO L93 Difference]: Finished difference Result 4241 states and 5858 transitions. [2023-12-16 06:31:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2023-12-16 06:31:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:37,521 INFO L225 Difference]: With dead ends: 4241 [2023-12-16 06:31:37,521 INFO L226 Difference]: Without dead ends: 2301 [2023-12-16 06:31:37,542 INFO L412 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 [2023-12-16 06:31:37,559 INFO L413 NwaCegarLoop]: 1270 mSDtfsCounter, 9060 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9060 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:37,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9060 Valid, 1330 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 06:31:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2023-12-16 06:31:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2023-12-16 06:31:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2264 states have (on average 1.372791519434629) internal successors, (3108), 2300 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3108 transitions. [2023-12-16 06:31:37,613 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3108 transitions. Word has length 118 [2023-12-16 06:31:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:37,614 INFO L495 AbstractCegarLoop]: Abstraction has 2301 states and 3108 transitions. [2023-12-16 06:31:37,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3108 transitions. [2023-12-16 06:31:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 06:31:37,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:37,622 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 06:31:37,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:37,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1175064949, now seen corresponding path program 1 times [2023-12-16 06:31:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287640827] [2023-12-16 06:31:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287640827] [2023-12-16 06:31:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287640827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598665485] [2023-12-16 06:31:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:37,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:37,933 INFO L87 Difference]: Start difference. First operand 2301 states and 3108 transitions. Second operand has 5 states, 5 states have (on average 23.8) 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) [2023-12-16 06:31:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:39,168 INFO L93 Difference]: Finished difference Result 4081 states and 5664 transitions. [2023-12-16 06:31:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) 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 119 [2023-12-16 06:31:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:39,176 INFO L225 Difference]: With dead ends: 4081 [2023-12-16 06:31:39,176 INFO L226 Difference]: Without dead ends: 2125 [2023-12-16 06:31:39,179 INFO L412 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 [2023-12-16 06:31:39,180 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 8590 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8590 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:39,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8590 Valid, 1542 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 06:31:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-12-16 06:31:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2023-12-16 06:31:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2088 states have (on average 1.3960727969348659) internal successors, (2915), 2124 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2915 transitions. [2023-12-16 06:31:39,218 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2915 transitions. Word has length 119 [2023-12-16 06:31:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:39,219 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2915 transitions. [2023-12-16 06:31:39,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) 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) [2023-12-16 06:31:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2915 transitions. [2023-12-16 06:31:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 06:31:39,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:39,224 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:39,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 06:31:39,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:39,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -454932709, now seen corresponding path program 1 times [2023-12-16 06:31:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467512897] [2023-12-16 06:31:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467512897] [2023-12-16 06:31:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467512897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120941937] [2023-12-16 06:31:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:39,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:39,471 INFO L87 Difference]: Start difference. First operand 2125 states and 2915 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:40,652 INFO L93 Difference]: Finished difference Result 3905 states and 5470 transitions. [2023-12-16 06:31:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:40,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2023-12-16 06:31:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:40,691 INFO L225 Difference]: With dead ends: 3905 [2023-12-16 06:31:40,691 INFO L226 Difference]: Without dead ends: 2001 [2023-12-16 06:31:40,695 INFO L412 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 [2023-12-16 06:31:40,696 INFO L413 NwaCegarLoop]: 1502 mSDtfsCounter, 8235 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8235 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:40,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8235 Valid, 1530 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 06:31:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2023-12-16 06:31:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2023-12-16 06:31:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1964 states have (on average 1.4164969450101832) internal successors, (2782), 2000 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2782 transitions. [2023-12-16 06:31:40,791 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2782 transitions. Word has length 120 [2023-12-16 06:31:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:40,791 INFO L495 AbstractCegarLoop]: Abstraction has 2001 states and 2782 transitions. [2023-12-16 06:31:40,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2782 transitions. [2023-12-16 06:31:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 06:31:40,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:40,796 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:40,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 06:31:40,797 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:40,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2030592158, now seen corresponding path program 1 times [2023-12-16 06:31:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:40,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615398500] [2023-12-16 06:31:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615398500] [2023-12-16 06:31:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615398500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309913331] [2023-12-16 06:31:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:40,994 INFO L87 Difference]: Start difference. First operand 2001 states and 2782 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:42,176 INFO L93 Difference]: Finished difference Result 3781 states and 5336 transitions. [2023-12-16 06:31:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2023-12-16 06:31:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:42,183 INFO L225 Difference]: With dead ends: 3781 [2023-12-16 06:31:42,183 INFO L226 Difference]: Without dead ends: 1927 [2023-12-16 06:31:42,186 INFO L412 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 [2023-12-16 06:31:42,188 INFO L413 NwaCegarLoop]: 1482 mSDtfsCounter, 8025 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8025 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:42,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8025 Valid, 1494 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 06:31:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2023-12-16 06:31:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927. [2023-12-16 06:31:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1890 states have (on average 1.4301587301587302) internal successors, (2703), 1926 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2703 transitions. [2023-12-16 06:31:42,228 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2703 transitions. Word has length 121 [2023-12-16 06:31:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:42,229 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 2703 transitions. [2023-12-16 06:31:42,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2703 transitions. [2023-12-16 06:31:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 06:31:42,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:42,233 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 06:31:42,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:42,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 541891792, now seen corresponding path program 1 times [2023-12-16 06:31:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507386067] [2023-12-16 06:31:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507386067] [2023-12-16 06:31:42,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507386067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:42,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:42,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764873647] [2023-12-16 06:31:42,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:42,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:42,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:42,456 INFO L87 Difference]: Start difference. First operand 1927 states and 2703 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:44,089 INFO L93 Difference]: Finished difference Result 4721 states and 6682 transitions. [2023-12-16 06:31:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2023-12-16 06:31:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:44,097 INFO L225 Difference]: With dead ends: 4721 [2023-12-16 06:31:44,097 INFO L226 Difference]: Without dead ends: 2901 [2023-12-16 06:31:44,103 INFO L412 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 [2023-12-16 06:31:44,104 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 10757 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10757 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:44,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10757 Valid, 2254 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2023-12-16 06:31:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2775. [2023-12-16 06:31:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2738 states have (on average 1.4558071585098613) internal successors, (3986), 2774 states have internal predecessors, (3986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3986 transitions. [2023-12-16 06:31:44,161 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3986 transitions. Word has length 122 [2023-12-16 06:31:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:44,161 INFO L495 AbstractCegarLoop]: Abstraction has 2775 states and 3986 transitions. [2023-12-16 06:31:44,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3986 transitions. [2023-12-16 06:31:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 06:31:44,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:44,167 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:44,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 06:31:44,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:44,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -965925399, now seen corresponding path program 1 times [2023-12-16 06:31:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491486064] [2023-12-16 06:31:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491486064] [2023-12-16 06:31:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491486064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:44,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505968127] [2023-12-16 06:31:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:44,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:44,355 INFO L87 Difference]: Start difference. First operand 2775 states and 3986 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:45,484 INFO L93 Difference]: Finished difference Result 5443 states and 7864 transitions. [2023-12-16 06:31:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:45,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2023-12-16 06:31:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:45,494 INFO L225 Difference]: With dead ends: 5443 [2023-12-16 06:31:45,494 INFO L226 Difference]: Without dead ends: 2761 [2023-12-16 06:31:45,498 INFO L412 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 [2023-12-16 06:31:45,500 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 7803 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7803 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:45,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7803 Valid, 1448 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 06:31:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2023-12-16 06:31:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2761. [2023-12-16 06:31:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4570484581497798) internal successors, (3969), 2760 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3969 transitions. [2023-12-16 06:31:45,564 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3969 transitions. Word has length 123 [2023-12-16 06:31:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:45,564 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3969 transitions. [2023-12-16 06:31:45,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3969 transitions. [2023-12-16 06:31:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 06:31:45,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:45,570 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:45,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 06:31:45,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:45,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 724063685, now seen corresponding path program 1 times [2023-12-16 06:31:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27724074] [2023-12-16 06:31:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27724074] [2023-12-16 06:31:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27724074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 06:31:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378383199] [2023-12-16 06:31:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:46,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 06:31:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 06:31:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 06:31:46,280 INFO L87 Difference]: Start difference. First operand 2761 states and 3969 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:49,942 INFO L93 Difference]: Finished difference Result 5345 states and 7684 transitions. [2023-12-16 06:31:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:31:49,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-16 06:31:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:49,955 INFO L225 Difference]: With dead ends: 5345 [2023-12-16 06:31:49,955 INFO L226 Difference]: Without dead ends: 4669 [2023-12-16 06:31:49,957 INFO L412 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 [2023-12-16 06:31:49,957 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 13073 mSDsluCounter, 7516 mSDsCounter, 0 mSdLazyCounter, 7425 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13073 SdHoareTripleChecker+Valid, 8989 SdHoareTripleChecker+Invalid, 7428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:49,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13073 Valid, 8989 Invalid, 7428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7425 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-16 06:31:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2023-12-16 06:31:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 2761. [2023-12-16 06:31:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4563142437591776) internal successors, (3967), 2760 states have internal predecessors, (3967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3967 transitions. [2023-12-16 06:31:50,027 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3967 transitions. Word has length 124 [2023-12-16 06:31:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:50,027 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3967 transitions. [2023-12-16 06:31:50,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3967 transitions. [2023-12-16 06:31:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 06:31:50,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:50,033 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:50,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 06:31:50,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:50,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1430403584, now seen corresponding path program 1 times [2023-12-16 06:31:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:50,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474100767] [2023-12-16 06:31:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:50,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474100767] [2023-12-16 06:31:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474100767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:31:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144010926] [2023-12-16 06:31:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:50,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 06:31:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 06:31:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:50,475 INFO L87 Difference]: Start difference. First operand 2761 states and 3967 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:52,942 INFO L93 Difference]: Finished difference Result 4586 states and 6337 transitions. [2023-12-16 06:31:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:31:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-16 06:31:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:52,965 INFO L225 Difference]: With dead ends: 4586 [2023-12-16 06:31:52,966 INFO L226 Difference]: Without dead ends: 3479 [2023-12-16 06:31:52,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:31:52,970 INFO L413 NwaCegarLoop]: 1133 mSDtfsCounter, 7935 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 3995 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7935 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:52,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7935 Valid, 3504 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3995 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 06:31:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2023-12-16 06:31:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 2761. [2023-12-16 06:31:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4559471365638768) internal successors, (3966), 2760 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3966 transitions. [2023-12-16 06:31:53,027 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3966 transitions. Word has length 124 [2023-12-16 06:31:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:53,027 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3966 transitions. [2023-12-16 06:31:53,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3966 transitions. [2023-12-16 06:31:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 06:31:53,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:53,033 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:53,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 06:31:53,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:53,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2082888358, now seen corresponding path program 1 times [2023-12-16 06:31:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:53,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774407156] [2023-12-16 06:31:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774407156] [2023-12-16 06:31:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774407156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415942594] [2023-12-16 06:31:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:53,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:53,531 INFO L87 Difference]: Start difference. First operand 2761 states and 3966 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:56,203 INFO L93 Difference]: Finished difference Result 3657 states and 5276 transitions. [2023-12-16 06:31:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:31:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-16 06:31:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:56,219 INFO L225 Difference]: With dead ends: 3657 [2023-12-16 06:31:56,219 INFO L226 Difference]: Without dead ends: 3054 [2023-12-16 06:31:56,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:31:56,222 INFO L413 NwaCegarLoop]: 2030 mSDtfsCounter, 4167 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 5728 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:56,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 8286 Invalid, 5732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5728 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 06:31:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2023-12-16 06:31:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2761. [2023-12-16 06:31:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4555800293685757) internal successors, (3965), 2760 states have internal predecessors, (3965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3965 transitions. [2023-12-16 06:31:56,300 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3965 transitions. Word has length 124 [2023-12-16 06:31:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:56,300 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3965 transitions. [2023-12-16 06:31:56,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3965 transitions. [2023-12-16 06:31:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 06:31:56,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:56,305 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:56,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 06:31:56,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:56,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 722590670, now seen corresponding path program 1 times [2023-12-16 06:31:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863284502] [2023-12-16 06:31:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863284502] [2023-12-16 06:31:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863284502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111613512] [2023-12-16 06:31:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:56,673 INFO L87 Difference]: Start difference. First operand 2761 states and 3965 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:59,776 INFO L93 Difference]: Finished difference Result 4929 states and 7094 transitions. [2023-12-16 06:31:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-16 06:31:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:59,788 INFO L225 Difference]: With dead ends: 4929 [2023-12-16 06:31:59,788 INFO L226 Difference]: Without dead ends: 4641 [2023-12-16 06:31:59,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:59,792 INFO L413 NwaCegarLoop]: 1713 mSDtfsCounter, 11068 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 6042 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11068 SdHoareTripleChecker+Valid, 7363 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:59,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11068 Valid, 7363 Invalid, 6046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6042 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 06:31:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2023-12-16 06:31:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 2761. [2023-12-16 06:31:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4552129221732746) internal successors, (3964), 2760 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3964 transitions. [2023-12-16 06:31:59,929 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3964 transitions. Word has length 124 [2023-12-16 06:31:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:59,929 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3964 transitions. [2023-12-16 06:31:59,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3964 transitions. [2023-12-16 06:31:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 06:31:59,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:59,934 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 06:31:59,935 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 06:31:59,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 46269361, now seen corresponding path program 1 times [2023-12-16 06:31:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736423050] [2023-12-16 06:31:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:32:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:32:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:32:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:32:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736423050] [2023-12-16 06:32:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736423050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:32:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:32:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:32:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809214788] [2023-12-16 06:32:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:32:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:32:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:32:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:32:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:32:00,388 INFO L87 Difference]: Start difference. First operand 2761 states and 3964 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 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) Received shutdown request... [2023-12-16 06:32:02,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:32:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:32:02,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:32:02,954 INFO L413 NwaCegarLoop]: 1306 mSDtfsCounter, 5350 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 5065 SdHoareTripleChecker+Invalid, 5454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:32:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 5065 Invalid, 5454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5452 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-16 06:32:02,955 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (36 of 37 remaining) [2023-12-16 06:32:02,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 06:32:02,957 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). [2023-12-16 06:32:02,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 37 remaining) [2023-12-16 06:32:02,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 37 remaining) [2023-12-16 06:32:02,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 37 remaining) [2023-12-16 06:32:02,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 37 remaining) [2023-12-16 06:32:02,959 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2023-12-16 06:32:02,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 37 remaining) [2023-12-16 06:32:02,961 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (1 of 37 remaining) [2023-12-16 06:32:02,962 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (0 of 37 remaining) [2023-12-16 06:32:02,966 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:32:02,968 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:32:02,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:32:02 BoogieIcfgContainer [2023-12-16 06:32:02,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:32:02,970 INFO L158 Benchmark]: Toolchain (without parser) took 50419.53ms. Allocated memory was 182.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.0MB in the beginning and 858.6MB in the end (delta: -746.6MB). Peak memory consumption was 478.6MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,970 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:32:02,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5099.21ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 112.0MB in the beginning and 69.0MB in the end (delta: 43.0MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 464.92ms. Allocated memory is still 247.5MB. Free memory was 69.0MB in the beginning and 74.2MB in the end (delta: -5.3MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,971 INFO L158 Benchmark]: Boogie Preprocessor took 688.28ms. Allocated memory was 247.5MB in the beginning and 335.5MB in the end (delta: 88.1MB). Free memory was 74.2MB in the beginning and 131.4MB in the end (delta: -57.1MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,971 INFO L158 Benchmark]: RCFGBuilder took 9441.12ms. Allocated memory was 335.5MB in the beginning and 703.6MB in the end (delta: 368.1MB). Free memory was 131.4MB in the beginning and 294.5MB in the end (delta: -163.1MB). Peak memory consumption was 310.9MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,971 INFO L158 Benchmark]: TraceAbstraction took 34717.65ms. Allocated memory was 703.6MB in the beginning and 1.4GB in the end (delta: 703.6MB). Free memory was 293.9MB in the beginning and 858.6MB in the end (delta: -564.6MB). Peak memory consumption was 139.0MB. Max. memory is 8.0GB. [2023-12-16 06:32:02,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 5099.21ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 112.0MB in the beginning and 69.0MB in the end (delta: 43.0MB). Peak memory consumption was 115.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 464.92ms. Allocated memory is still 247.5MB. Free memory was 69.0MB in the beginning and 74.2MB in the end (delta: -5.3MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 688.28ms. Allocated memory was 247.5MB in the beginning and 335.5MB in the end (delta: 88.1MB). Free memory was 74.2MB in the beginning and 131.4MB in the end (delta: -57.1MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. * RCFGBuilder took 9441.12ms. Allocated memory was 335.5MB in the beginning and 703.6MB in the end (delta: 368.1MB). Free memory was 131.4MB in the beginning and 294.5MB in the end (delta: -163.1MB). Peak memory consumption was 310.9MB. Max. memory is 8.0GB. * TraceAbstraction took 34717.65ms. Allocated memory was 703.6MB in the beginning and 1.4GB in the end (delta: 703.6MB). Free memory was 293.9MB in the beginning and 858.6MB in the end (delta: -564.6MB). Peak memory consumption was 139.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 10566]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10566). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1170]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1170). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1653]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1653). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1751]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1751). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1808]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1808). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1934]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1934). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1991]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1991). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2076]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2076). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2273]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2273). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2330]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2330). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2415]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2415). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2571]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2571). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2881]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2881). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2938]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2938). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3023]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3023). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3179]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3179). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3448]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3448). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3953]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3953). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4010]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4010). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4095]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4095). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4251]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4251). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4520]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4520). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4984]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4984). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5846]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5846). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5903]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5903). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5987]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5987). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6142]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6142). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6426]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6426). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6939]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6939). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 7861]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7861). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9535]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9535). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9592]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9592). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9677]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9677). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9833]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9833). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 10102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10102). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 11387]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 11387). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 12849]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12849). Cancelled while NwaCegarLoop was constructing difference of abstraction (2761states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (3620 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3891 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119895 SdHoareTripleChecker+Valid, 25.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119895 mSDsluCounter, 48125 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26645 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41021 IncrementalHoareTripleChecker+Invalid, 41415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 21480 mSDtfsCounter, 41021 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3891occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 4925 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1578 NumberOfCodeBlocks, 1578 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1565 ConstructedInterpolants, 0 QuantifiedInterpolants, 8910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown