/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 18:31:33,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:31:33,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 18:31:33,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:31:33,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:31:33,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:31:33,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:31:33,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:31:33,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:31:33,732 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:31:33,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:31:33,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:31:33,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:31:33,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:31:33,734 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:31:33,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:31:33,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:31:33,734 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 18:31:33,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 18:31:33,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:31:33,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:31:33,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:31:33,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:31:33,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 18:31:33,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 18:31:33,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:31:33,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 18:31:33,737 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 18:31:33,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:31:33,737 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:31:33,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:31:33,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:31:33,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:31:33,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:31:33,739 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 18:31:33,739 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 [2023-12-16 18:31:33,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:31:33,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:31:33,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:31:33,921 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:31:33,922 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:31:33,924 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-16 18:31:34,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:31:35,425 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:31:35,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-16 18:31:35,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dc832c3/226a88aeb84944a5ae9c2f0d07daca5f/FLAG36fa349df [2023-12-16 18:31:35,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dc832c3/226a88aeb84944a5ae9c2f0d07daca5f [2023-12-16 18:31:35,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:31:35,492 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:31:35,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:31:35,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:31:35,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:31:35,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:35" (1/1) ... [2023-12-16 18:31:35,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ca9af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:35, skipping insertion in model container [2023-12-16 18:31:35,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:31:35" (1/1) ... [2023-12-16 18:31:35,815 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:31:36,282 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2023-12-16 18:31:36,323 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.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2023-12-16 18:31:36,334 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.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2023-12-16 18:31:36,339 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.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2023-12-16 18:31:36,363 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2023-12-16 18:31:36,370 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.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2023-12-16 18:31:36,383 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.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2023-12-16 18:31:36,413 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.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2023-12-16 18:31:36,418 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.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2023-12-16 18:31:36,422 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.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2023-12-16 18:31:36,436 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.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2023-12-16 18:31:36,463 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.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2023-12-16 18:31:36,471 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.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2023-12-16 18:31:36,476 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.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2023-12-16 18:31:36,484 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.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2023-12-16 18:31:36,503 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.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2023-12-16 18:31:36,528 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.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2023-12-16 18:31:36,531 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.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2023-12-16 18:31:36,545 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.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2023-12-16 18:31:36,554 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.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2023-12-16 18:31:36,568 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.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2023-12-16 18:31:36,587 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.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2023-12-16 18:31:36,656 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.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2023-12-16 18:31:36,661 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.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2023-12-16 18:31:36,666 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.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2023-12-16 18:31:36,678 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.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2023-12-16 18:31:36,691 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.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2023-12-16 18:31:36,722 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.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2023-12-16 18:31:36,771 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.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2023-12-16 18:31:36,846 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.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2023-12-16 18:31:36,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.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2023-12-16 18:31:36,857 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.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2023-12-16 18:31:36,867 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.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2023-12-16 18:31:36,878 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.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2023-12-16 18:31:36,898 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.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2023-12-16 18:31:36,925 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.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2023-12-16 18:31:36,997 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.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2023-12-16 18:31:37,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:31:37,925 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:31:38,018 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21603,21616] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[27289,27302] [2023-12-16 18:31:38,034 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.UNBOUNDED.pals.c.v+lhb-reducer.c[28711,28724] [2023-12-16 18:31:38,038 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.UNBOUNDED.pals.c.v+lhb-reducer.c[29569,29582] [2023-12-16 18:31:38,048 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31319,31332] [2023-12-16 18:31:38,052 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.UNBOUNDED.pals.c.v+lhb-reducer.c[32177,32190] [2023-12-16 18:31:38,056 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.UNBOUNDED.pals.c.v+lhb-reducer.c[33363,33376] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[36132,36145] [2023-12-16 18:31:38,067 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.UNBOUNDED.pals.c.v+lhb-reducer.c[36993,37006] [2023-12-16 18:31:38,072 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.UNBOUNDED.pals.c.v+lhb-reducer.c[38182,38195] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[40387,40400] [2023-12-16 18:31:38,088 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.UNBOUNDED.pals.c.v+lhb-reducer.c[44640,44653] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[45501,45514] [2023-12-16 18:31:38,095 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.UNBOUNDED.pals.c.v+lhb-reducer.c[46690,46703] [2023-12-16 18:31:38,101 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.UNBOUNDED.pals.c.v+lhb-reducer.c[48895,48908] [2023-12-16 18:31:38,110 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.UNBOUNDED.pals.c.v+lhb-reducer.c[52584,52597] [2023-12-16 18:31:38,124 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.UNBOUNDED.pals.c.v+lhb-reducer.c[59245,59258] [2023-12-16 18:31:38,127 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.UNBOUNDED.pals.c.v+lhb-reducer.c[60106,60119] [2023-12-16 18:31:38,131 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.UNBOUNDED.pals.c.v+lhb-reducer.c[61295,61308] [2023-12-16 18:31:38,137 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.UNBOUNDED.pals.c.v+lhb-reducer.c[63500,63513] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[67189,67202] [2023-12-16 18:31:38,160 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.UNBOUNDED.pals.c.v+lhb-reducer.c[73286,73299] [2023-12-16 18:31:38,181 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.UNBOUNDED.pals.c.v+lhb-reducer.c[84175,84188] [2023-12-16 18:31:38,186 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.UNBOUNDED.pals.c.v+lhb-reducer.c[85036,85049] [2023-12-16 18:31:38,190 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.UNBOUNDED.pals.c.v+lhb-reducer.c[86229,86242] [2023-12-16 18:31:38,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.UNBOUNDED.pals.c.v+lhb-reducer.c[88438,88451] [2023-12-16 18:31:38,206 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.UNBOUNDED.pals.c.v+lhb-reducer.c[92411,92424] [2023-12-16 18:31:38,249 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.UNBOUNDED.pals.c.v+lhb-reducer.c[99364,99377] [2023-12-16 18:31:38,276 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.UNBOUNDED.pals.c.v+lhb-reducer.c[111409,111422] [2023-12-16 18:31:38,317 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.UNBOUNDED.pals.c.v+lhb-reducer.c[132586,132599] [2023-12-16 18:31:38,320 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.UNBOUNDED.pals.c.v+lhb-reducer.c[133447,133460] [2023-12-16 18:31:38,324 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.UNBOUNDED.pals.c.v+lhb-reducer.c[134636,134649] [2023-12-16 18:31:38,329 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.UNBOUNDED.pals.c.v+lhb-reducer.c[136841,136854] [2023-12-16 18:31:38,338 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.UNBOUNDED.pals.c.v+lhb-reducer.c[140530,140543] [2023-12-16 18:31:38,351 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.UNBOUNDED.pals.c.v+lhb-reducer.c[146627,146640] [2023-12-16 18:31:38,377 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.UNBOUNDED.pals.c.v+lhb-reducer.c[156952,156965] [2023-12-16 18:31:38,411 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.UNBOUNDED.pals.c.v+lhb-reducer.c[174689,174702] [2023-12-16 18:31:39,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:31:39,139 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:31:39,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:39 WrapperNode [2023-12-16 18:31:39,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:31:39,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:31:39,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:31:39,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:31:39,149 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:39" (1/1) ... [2023-12-16 18:31:39,267 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:39" (1/1) ... [2023-12-16 18:31:39,612 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24689 [2023-12-16 18:31:39,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:31:39,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:31:39,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:31:39,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:31:39,621 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:39" (1/1) ... [2023-12-16 18:31:39,622 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:39" (1/1) ... [2023-12-16 18:31:39,685 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:39" (1/1) ... [2023-12-16 18:31:39,836 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 18:31:39,837 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:39" (1/1) ... [2023-12-16 18:31:39,837 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:39" (1/1) ... [2023-12-16 18:31:39,930 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:39" (1/1) ... [2023-12-16 18:31:39,968 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:39" (1/1) ... [2023-12-16 18:31:39,998 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:39" (1/1) ... [2023-12-16 18:31:40,087 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:39" (1/1) ... [2023-12-16 18:31:40,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:31:40,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:31:40,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:31:40,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:31:40,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:39" (1/1) ... [2023-12-16 18:31:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:31:40,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:31:40,269 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 18:31:40,304 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 18:31:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:31:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:31:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:31:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:31:40,815 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:31:40,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:31:51,832 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:31:52,048 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:31:52,049 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 18:31:52,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:52 BoogieIcfgContainer [2023-12-16 18:31:52,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:31:52,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:31:52,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:31:52,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:31:52,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:31:35" (1/3) ... [2023-12-16 18:31:52,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ae2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:52, skipping insertion in model container [2023-12-16 18:31:52,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:31:39" (2/3) ... [2023-12-16 18:31:52,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ae2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:52, skipping insertion in model container [2023-12-16 18:31:52,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:52" (3/3) ... [2023-12-16 18:31:52,056 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-16 18:31:52,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:31:52,081 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-12-16 18:31:52,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:31:52,159 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;@7fab0562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:31:52,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-12-16 18:31:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 3852 states, 3814 states have (on average 1.8749344520188778) internal successors, (7151), 3851 states have internal predecessors, (7151), 0 states have call successors, (0), 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 18:31:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 18:31:52,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:52,209 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] [2023-12-16 18:31:52,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:31:52,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1289712745, now seen corresponding path program 1 times [2023-12-16 18:31:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078448592] [2023-12-16 18:31:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:31:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:52,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:31:52,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 18:31:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:52,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:52,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:53,445 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 18:31:53,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:53,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:53,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078448592] [2023-12-16 18:31:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078448592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:53,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169614113] [2023-12-16 18:31:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:53,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:53,481 INFO L87 Difference]: Start difference. First operand has 3852 states, 3814 states have (on average 1.8749344520188778) internal successors, (7151), 3851 states have internal predecessors, (7151), 0 states have call successors, (0), 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.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 18:31:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:56,599 INFO L93 Difference]: Finished difference Result 6597 states and 11755 transitions. [2023-12-16 18:31:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:56,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-16 18:31:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:56,621 INFO L225 Difference]: With dead ends: 6597 [2023-12-16 18:31:56,621 INFO L226 Difference]: Without dead ends: 3826 [2023-12-16 18:31:56,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:56,631 INFO L413 NwaCegarLoop]: 3373 mSDtfsCounter, 18342 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18342 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:56,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18342 Valid, 4371 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 18:31:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2023-12-16 18:31:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3700. [2023-12-16 18:31:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 3663 states have (on average 1.378924378924379) internal successors, (5051), 3699 states have internal predecessors, (5051), 0 states have call successors, (0), 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 18:31:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5051 transitions. [2023-12-16 18:31:56,744 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5051 transitions. Word has length 115 [2023-12-16 18:31:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:56,746 INFO L495 AbstractCegarLoop]: Abstraction has 3700 states and 5051 transitions. [2023-12-16 18:31:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 18:31:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5051 transitions. [2023-12-16 18:31:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 18:31:56,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:56,753 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 18:31:56,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 18:31:56,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:31:56,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:31:56,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:31:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 54363293, now seen corresponding path program 1 times [2023-12-16 18:31:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:31:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430498036] [2023-12-16 18:31:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:31:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:31:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:31:56,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:31:56,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 18:31:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:31:57,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:31:57,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:31:58,068 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 18:31:58,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:31:58,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:31:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430498036] [2023-12-16 18:31:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430498036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:31:58,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:31:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:31:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59177262] [2023-12-16 18:31:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:31:58,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:31:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:31:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:31:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:31:58,071 INFO L87 Difference]: Start difference. First operand 3700 states and 5051 transitions. 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 18:31:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:31:59,755 INFO L93 Difference]: Finished difference Result 6313 states and 8888 transitions. [2023-12-16 18:31:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:31:59,756 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 18:31:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:31:59,764 INFO L225 Difference]: With dead ends: 6313 [2023-12-16 18:31:59,764 INFO L226 Difference]: Without dead ends: 3191 [2023-12-16 18:31:59,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:31:59,769 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 9341 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9341 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:31:59,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9341 Valid, 1801 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:31:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2023-12-16 18:31:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3191. [2023-12-16 18:31:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3154 states have (on average 1.419150285351934) internal successors, (4476), 3190 states have internal predecessors, (4476), 0 states have call successors, (0), 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 18:31:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4476 transitions. [2023-12-16 18:31:59,814 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4476 transitions. Word has length 116 [2023-12-16 18:31:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:31:59,815 INFO L495 AbstractCegarLoop]: Abstraction has 3191 states and 4476 transitions. [2023-12-16 18:31:59,815 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 18:31:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4476 transitions. [2023-12-16 18:31:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 18:31:59,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:31:59,820 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 18:31:59,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 18:32:00,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:00,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:00,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1799781066, now seen corresponding path program 1 times [2023-12-16 18:32:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:00,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136184350] [2023-12-16 18:32:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:00,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:00,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:00,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:00,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 18:32:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:00,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:00,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:01,091 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 18:32:01,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:01,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136184350] [2023-12-16 18:32:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136184350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:01,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033788169] [2023-12-16 18:32:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:01,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:01,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:01,105 INFO L87 Difference]: Start difference. First operand 3191 states and 4476 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 18:32:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:02,714 INFO L93 Difference]: Finished difference Result 5804 states and 8311 transitions. [2023-12-16 18:32:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:02,714 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 18:32:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:02,722 INFO L225 Difference]: With dead ends: 5804 [2023-12-16 18:32:02,722 INFO L226 Difference]: Without dead ends: 2938 [2023-12-16 18:32:02,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:02,725 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 8471 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8471 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:02,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8471 Valid, 1612 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:32:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2023-12-16 18:32:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2938. [2023-12-16 18:32:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2901 states have (on average 1.4439848328162703) internal successors, (4189), 2937 states have internal predecessors, (4189), 0 states have call successors, (0), 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 18:32:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4189 transitions. [2023-12-16 18:32:02,761 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4189 transitions. Word has length 117 [2023-12-16 18:32:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:02,762 INFO L495 AbstractCegarLoop]: Abstraction has 2938 states and 4189 transitions. [2023-12-16 18:32:02,762 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 18:32:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4189 transitions. [2023-12-16 18:32:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 18:32:02,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:02,765 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 18:32:02,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 18:32:02,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:02,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:02,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2092860644, now seen corresponding path program 1 times [2023-12-16 18:32:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313386036] [2023-12-16 18:32:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:02,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:02,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:03,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 18:32:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:03,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:03,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:03,940 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 18:32:03,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:03,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313386036] [2023-12-16 18:32:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313386036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131309123] [2023-12-16 18:32:03,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:03,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:03,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:03,942 INFO L87 Difference]: Start difference. First operand 2938 states and 4189 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 18:32:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:05,181 INFO L93 Difference]: Finished difference Result 5551 states and 8022 transitions. [2023-12-16 18:32:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:05,182 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 18:32:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:05,191 INFO L225 Difference]: With dead ends: 5551 [2023-12-16 18:32:05,191 INFO L226 Difference]: Without dead ends: 2813 [2023-12-16 18:32:05,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:05,197 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 8031 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8031 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:05,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8031 Valid, 1513 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 18:32:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2023-12-16 18:32:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2023-12-16 18:32:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2776 states have (on average 1.457492795389049) internal successors, (4046), 2812 states have internal predecessors, (4046), 0 states have call successors, (0), 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 18:32:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4046 transitions. [2023-12-16 18:32:05,243 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4046 transitions. Word has length 118 [2023-12-16 18:32:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:05,245 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 4046 transitions. [2023-12-16 18:32:05,246 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 18:32:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4046 transitions. [2023-12-16 18:32:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 18:32:05,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:05,253 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 18:32:05,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:05,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:05,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 618381269, now seen corresponding path program 1 times [2023-12-16 18:32:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487671491] [2023-12-16 18:32:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:05,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:05,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:05,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:05,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 18:32:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:05,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:05,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:06,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 18:32:06,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:06,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487671491] [2023-12-16 18:32:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487671491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318891349] [2023-12-16 18:32:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:06,317 INFO L87 Difference]: Start difference. First operand 2813 states and 4046 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 18:32:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:07,624 INFO L93 Difference]: Finished difference Result 5426 states and 7877 transitions. [2023-12-16 18:32:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:07,624 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 18:32:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:07,631 INFO L225 Difference]: With dead ends: 5426 [2023-12-16 18:32:07,631 INFO L226 Difference]: Without dead ends: 2752 [2023-12-16 18:32:07,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:07,634 INFO L413 NwaCegarLoop]: 1414 mSDtfsCounter, 5215 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:07,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 1450 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 18:32:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2023-12-16 18:32:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2752. [2023-12-16 18:32:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 2715 states have (on average 1.4640883977900552) internal successors, (3975), 2751 states have internal predecessors, (3975), 0 states have call successors, (0), 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 18:32:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3975 transitions. [2023-12-16 18:32:07,690 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3975 transitions. Word has length 119 [2023-12-16 18:32:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 2752 states and 3975 transitions. [2023-12-16 18:32:07,690 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 18:32:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3975 transitions. [2023-12-16 18:32:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 18:32:07,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:07,694 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 18:32:07,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:07,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:07,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1576716955, now seen corresponding path program 1 times [2023-12-16 18:32:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550339239] [2023-12-16 18:32:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:07,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:07,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:07,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 18:32:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:08,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:08,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:08,858 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 18:32:08,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:08,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550339239] [2023-12-16 18:32:08,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550339239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:08,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:08,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176505153] [2023-12-16 18:32:08,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:08,861 INFO L87 Difference]: Start difference. First operand 2752 states and 3975 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 18:32:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:10,289 INFO L93 Difference]: Finished difference Result 5365 states and 7804 transitions. [2023-12-16 18:32:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:10,289 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 18:32:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:10,296 INFO L225 Difference]: With dead ends: 5365 [2023-12-16 18:32:10,296 INFO L226 Difference]: Without dead ends: 2723 [2023-12-16 18:32:10,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:10,301 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 5124 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5124 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5124 Valid, 1387 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 18:32:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2023-12-16 18:32:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2723. [2023-12-16 18:32:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2686 states have (on average 1.4668652271034996) internal successors, (3940), 2722 states have internal predecessors, (3940), 0 states have call successors, (0), 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 18:32:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3940 transitions. [2023-12-16 18:32:10,345 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3940 transitions. Word has length 120 [2023-12-16 18:32:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:10,360 INFO L495 AbstractCegarLoop]: Abstraction has 2723 states and 3940 transitions. [2023-12-16 18:32:10,360 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 18:32:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3940 transitions. [2023-12-16 18:32:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 18:32:10,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:10,364 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 18:32:10,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:10,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:10,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:10,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1358139532, now seen corresponding path program 1 times [2023-12-16 18:32:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067216095] [2023-12-16 18:32:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:10,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:10,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:10,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 18:32:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:11,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:11,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:11,553 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 18:32:11,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:11,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:11,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067216095] [2023-12-16 18:32:11,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067216095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:11,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878771592] [2023-12-16 18:32:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:11,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:11,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:11,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:11,555 INFO L87 Difference]: Start difference. First operand 2723 states and 3940 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 18:32:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:13,011 INFO L93 Difference]: Finished difference Result 5336 states and 7767 transitions. [2023-12-16 18:32:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:13,012 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 18:32:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:13,022 INFO L225 Difference]: With dead ends: 5336 [2023-12-16 18:32:13,022 INFO L226 Difference]: Without dead ends: 2710 [2023-12-16 18:32:13,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:13,027 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 5053 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5053 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:13,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5053 Valid, 1281 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 18:32:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2023-12-16 18:32:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2710. [2023-12-16 18:32:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2673 states have (on average 1.4676393565282455) internal successors, (3923), 2709 states have internal predecessors, (3923), 0 states have call successors, (0), 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 18:32:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3923 transitions. [2023-12-16 18:32:13,128 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3923 transitions. Word has length 121 [2023-12-16 18:32:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:13,128 INFO L495 AbstractCegarLoop]: Abstraction has 2710 states and 3923 transitions. [2023-12-16 18:32:13,129 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 18:32:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3923 transitions. [2023-12-16 18:32:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 18:32:13,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:13,147 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 18:32:13,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 18:32:13,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:13,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:13,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash 3538714, now seen corresponding path program 1 times [2023-12-16 18:32:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414095358] [2023-12-16 18:32:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:13,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:13,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:13,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:13,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 18:32:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:13,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:32:13,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:14,297 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 18:32:14,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:14,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414095358] [2023-12-16 18:32:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414095358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:14,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:32:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750426238] [2023-12-16 18:32:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:14,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:32:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:32:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:32:14,300 INFO L87 Difference]: Start difference. First operand 2710 states and 3923 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 18:32:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:15,963 INFO L93 Difference]: Finished difference Result 5323 states and 7748 transitions. [2023-12-16 18:32:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:32:15,964 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 18:32:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:15,970 INFO L225 Difference]: With dead ends: 5323 [2023-12-16 18:32:15,970 INFO L226 Difference]: Without dead ends: 2705 [2023-12-16 18:32:15,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-16 18:32:15,973 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 4976 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:15,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 1047 Invalid, 1744 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:32:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2023-12-16 18:32:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2705. [2023-12-16 18:32:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2668 states have (on average 1.4673913043478262) internal successors, (3915), 2704 states have internal predecessors, (3915), 0 states have call successors, (0), 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 18:32:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3915 transitions. [2023-12-16 18:32:16,008 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3915 transitions. Word has length 122 [2023-12-16 18:32:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:16,008 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3915 transitions. [2023-12-16 18:32:16,008 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 18:32:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3915 transitions. [2023-12-16 18:32:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 18:32:16,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:16,012 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 18:32:16,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:16,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:16,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1090891821, now seen corresponding path program 1 times [2023-12-16 18:32:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473692263] [2023-12-16 18:32:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:16,239 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:16,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 18:32:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:16,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:16,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:17,411 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 18:32:17,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:17,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473692263] [2023-12-16 18:32:17,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473692263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:17,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046795269] [2023-12-16 18:32:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:17,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:17,413 INFO L87 Difference]: Start difference. First operand 2705 states and 3915 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:24,531 INFO L93 Difference]: Finished difference Result 3608 states and 5164 transitions. [2023-12-16 18:32:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 18:32:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:24,543 INFO L225 Difference]: With dead ends: 3608 [2023-12-16 18:32:24,543 INFO L226 Difference]: Without dead ends: 3019 [2023-12-16 18:32:24,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 18:32:24,556 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 8113 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 5071 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8113 SdHoareTripleChecker+Valid, 5980 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:24,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8113 Valid, 5980 Invalid, 5076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5071 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-16 18:32:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2023-12-16 18:32:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2705. [2023-12-16 18:32:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2668 states have (on average 1.4670164917541229) internal successors, (3914), 2704 states have internal predecessors, (3914), 0 states have call successors, (0), 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 18:32:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3914 transitions. [2023-12-16 18:32:24,643 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3914 transitions. Word has length 123 [2023-12-16 18:32:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:24,644 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3914 transitions. [2023-12-16 18:32:24,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3914 transitions. [2023-12-16 18:32:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 18:32:24,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:24,669 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 18:32:24,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:24,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:24,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:24,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1967446368, now seen corresponding path program 1 times [2023-12-16 18:32:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489746349] [2023-12-16 18:32:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:24,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:24,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:24,882 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:24,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 18:32:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:25,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:25,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:26,076 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 18:32:26,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:26,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:26,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489746349] [2023-12-16 18:32:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489746349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:26,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825096886] [2023-12-16 18:32:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:26,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:26,078 INFO L87 Difference]: Start difference. First operand 2705 states and 3914 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:31,615 INFO L93 Difference]: Finished difference Result 3257 states and 4743 transitions. [2023-12-16 18:32:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:32:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:31,623 INFO L225 Difference]: With dead ends: 3257 [2023-12-16 18:32:31,623 INFO L226 Difference]: Without dead ends: 2891 [2023-12-16 18:32:31,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:32:31,634 INFO L413 NwaCegarLoop]: 1469 mSDtfsCounter, 5973 mSDsluCounter, 3977 mSDsCounter, 0 mSdLazyCounter, 4642 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5973 SdHoareTripleChecker+Valid, 5446 SdHoareTripleChecker+Invalid, 4647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:31,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5973 Valid, 5446 Invalid, 4647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4642 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-16 18:32:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2023-12-16 18:32:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2705. [2023-12-16 18:32:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2668 states have (on average 1.4666416791604198) internal successors, (3913), 2704 states have internal predecessors, (3913), 0 states have call successors, (0), 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 18:32:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3913 transitions. [2023-12-16 18:32:31,679 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3913 transitions. Word has length 123 [2023-12-16 18:32:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:31,679 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3913 transitions. [2023-12-16 18:32:31,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 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 18:32:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3913 transitions. [2023-12-16 18:32:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 18:32:31,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:31,698 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 18:32:31,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:31,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:31,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 984788493, now seen corresponding path program 1 times [2023-12-16 18:32:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135375061] [2023-12-16 18:32:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:31,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:31,907 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:31,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 18:32:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:32,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 18:32:32,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:32,844 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 18:32:32,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:32,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135375061] [2023-12-16 18:32:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135375061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:32,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:32,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:32:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363004351] [2023-12-16 18:32:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:32:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:32:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:32:32,846 INFO L87 Difference]: Start difference. First operand 2705 states and 3913 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 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 18:32:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:32:36,809 INFO L93 Difference]: Finished difference Result 3793 states and 5460 transitions. [2023-12-16 18:32:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:32:36,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 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 18:32:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:32:36,817 INFO L225 Difference]: With dead ends: 3793 [2023-12-16 18:32:36,817 INFO L226 Difference]: Without dead ends: 2705 [2023-12-16 18:32:36,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 18:32:36,819 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 7539 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7539 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:36,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7539 Valid, 2036 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-16 18:32:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2023-12-16 18:32:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2705. [2023-12-16 18:32:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2668 states have (on average 1.4662668665667167) internal successors, (3912), 2704 states have internal predecessors, (3912), 0 states have call successors, (0), 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 18:32:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3912 transitions. [2023-12-16 18:32:36,850 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3912 transitions. Word has length 123 [2023-12-16 18:32:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:32:36,852 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3912 transitions. [2023-12-16 18:32:36,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 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 18:32:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3912 transitions. [2023-12-16 18:32:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 18:32:36,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:32:36,855 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] [2023-12-16 18:32:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:37,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:37,061 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2023-12-16 18:32:37,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:32:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1922041167, now seen corresponding path program 1 times [2023-12-16 18:32:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:32:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597572047] [2023-12-16 18:32:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:32:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:32:37,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 18:32:37,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 18:32:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:32:37,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:32:37,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:32:38,121 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 18:32:38,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:32:38,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:32:38,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597572047] [2023-12-16 18:32:38,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597572047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:32:38,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:32:38,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:32:38,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426480467] [2023-12-16 18:32:38,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:32:38,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:32:38,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:32:38,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:32:38,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:32:38,123 INFO L87 Difference]: Start difference. First operand 2705 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 18:32:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:32:38,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 18:32:38,876 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 794 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:32:38,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 358 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 18:32:38,877 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (36 of 37 remaining) [2023-12-16 18:32:38,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 18:32:38,885 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:32:38,906 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 18:32:39,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 18:32:39,079 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (35 of 37 remaining) [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (34 of 37 remaining) [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (33 of 37 remaining) [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (32 of 37 remaining) [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (31 of 37 remaining) [2023-12-16 18:32:39,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (30 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (29 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (28 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (27 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (26 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (25 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (24 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (23 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (22 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (21 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (20 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (19 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (18 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (17 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2023-12-16 18:32:39,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (15 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (14 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (13 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (12 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (11 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (10 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (9 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (8 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (7 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (6 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (5 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (4 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (3 of 37 remaining) [2023-12-16 18:32:39,083 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (2 of 37 remaining) [2023-12-16 18:32:39,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (1 of 37 remaining) [2023-12-16 18:32:39,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (0 of 37 remaining) [2023-12-16 18:32:39,086 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:32:39,092 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:32:39,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:32:39 BoogieIcfgContainer [2023-12-16 18:32:39,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:32:39,095 INFO L158 Benchmark]: Toolchain (without parser) took 63602.41ms. Allocated memory was 175.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.5MB in the beginning and 468.8MB in the end (delta: -356.3MB). Peak memory consumption was 984.2MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,095 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 175.1MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:32:39,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3649.28ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 112.5MB in the beginning and 85.8MB in the end (delta: 26.7MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 469.73ms. Allocated memory was 221.2MB in the beginning and 286.3MB in the end (delta: 65.0MB). Free memory was 85.2MB in the beginning and 138.7MB in the end (delta: -53.5MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,095 INFO L158 Benchmark]: Boogie Preprocessor took 570.39ms. Allocated memory was 286.3MB in the beginning and 568.3MB in the end (delta: 282.1MB). Free memory was 138.7MB in the beginning and 406.6MB in the end (delta: -267.9MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,096 INFO L158 Benchmark]: RCFGBuilder took 11849.64ms. Allocated memory was 568.3MB in the beginning and 841.0MB in the end (delta: 272.6MB). Free memory was 406.6MB in the beginning and 403.0MB in the end (delta: 3.7MB). Peak memory consumption was 487.6MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,096 INFO L158 Benchmark]: TraceAbstraction took 47043.07ms. Allocated memory was 841.0MB in the beginning and 1.5GB in the end (delta: 673.2MB). Free memory was 401.9MB in the beginning and 468.8MB in the end (delta: -66.9MB). Peak memory consumption was 607.3MB. Max. memory is 8.0GB. [2023-12-16 18:32:39,097 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.46ms. Allocated memory is still 175.1MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3649.28ms. Allocated memory was 175.1MB in the beginning and 221.2MB in the end (delta: 46.1MB). Free memory was 112.5MB in the beginning and 85.8MB in the end (delta: 26.7MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 469.73ms. Allocated memory was 221.2MB in the beginning and 286.3MB in the end (delta: 65.0MB). Free memory was 85.2MB in the beginning and 138.7MB in the end (delta: -53.5MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 570.39ms. Allocated memory was 286.3MB in the beginning and 568.3MB in the end (delta: 282.1MB). Free memory was 138.7MB in the beginning and 406.6MB in the end (delta: -267.9MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * RCFGBuilder took 11849.64ms. Allocated memory was 568.3MB in the beginning and 841.0MB in the end (delta: 272.6MB). Free memory was 406.6MB in the beginning and 403.0MB in the end (delta: 3.7MB). Peak memory consumption was 487.6MB. Max. memory is 8.0GB. * TraceAbstraction took 47043.07ms. Allocated memory was 841.0MB in the beginning and 1.5GB in the end (delta: 673.2MB). Free memory was 401.9MB in the beginning and 468.8MB in the end (delta: -66.9MB). Peak memory consumption was 607.3MB. 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: 1151]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1151). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1628]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1628). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1726]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1726). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1783]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1783). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1908]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1908). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1965]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1965). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2049). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2244]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2244). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2301]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2301). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2385]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2385). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2539]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2539). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2845]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2845). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2902]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2902). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2986]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2986). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3140]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3140). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3405]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3405). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3903]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3903). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3960]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3960). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4044]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4044). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4198]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4198). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4463]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4463). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4920]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4920). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5770]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5770). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5827]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5827). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5911]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5911). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6065]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6065). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6346]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6346). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6852]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6852). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 7760]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7760). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9408]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9408). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9465]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9465). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9549]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9549). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9703]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9703). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 9968]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9968). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 10425]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10425). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 11234]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 11234). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 12675]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12675). Cancelled while NwaCegarLoop was constructing difference of abstraction (2705states) and FLOYD_HOARE automaton (currently 9 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (320 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3852 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86972 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86972 mSDsluCounter, 28282 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11027 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25308 IncrementalHoareTripleChecker+Invalid, 25710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 17255 mSDtfsCounter, 25308 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 1383 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3852occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 626 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1430 ConstructedInterpolants, 800 QuantifiedInterpolants, 15720 SizeOfPredicates, 44 NumberOfNonLiveVariables, 7779 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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