/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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 18:29:37,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 18:29:37,644 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:29:37,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 18:29:37,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 18:29:37,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 18:29:37,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 18:29:37,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 18:29:37,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 18:29:37,673 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 18:29:37,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 18:29:37,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 18:29:37,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 18:29:37,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 18:29:37,675 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 18:29:37,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 18:29:37,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 18:29:37,676 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 18:29:37,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 18:29:37,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 18:29:37,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 18:29:37,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 18:29:37,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 18:29:37,678 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 18:29:37,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:29:37,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 18:29:37,679 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 18:29:37,680 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 18:29:37,680 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:29:37,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 18:29:37,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 18:29:37,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 18:29:37,900 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 18:29:37,900 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 18:29:37,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2023-12-16 18:29:38,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 18:29:39,319 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 18:29:39,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2023-12-16 18:29:39,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65d0ce0a/3abeb1e0e3f741ce8870199ecf721385/FLAGe5bfeff22 [2023-12-16 18:29:39,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65d0ce0a/3abeb1e0e3f741ce8870199ecf721385 [2023-12-16 18:29:39,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 18:29:39,367 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 18:29:39,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 18:29:39,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 18:29:39,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 18:29:39,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:29:39" (1/1) ... [2023-12-16 18:29:39,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3774e466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:39, skipping insertion in model container [2023-12-16 18:29:39,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:29:39" (1/1) ... [2023-12-16 18:29:39,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 18:29:40,139 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2023-12-16 18:29:40,242 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2023-12-16 18:29:40,288 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2023-12-16 18:29:40,308 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2023-12-16 18:29:40,321 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2023-12-16 18:29:40,332 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2023-12-16 18:29:40,452 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2023-12-16 18:29:40,479 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2023-12-16 18:29:40,493 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2023-12-16 18:29:40,501 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2023-12-16 18:29:40,509 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2023-12-16 18:29:40,541 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2023-12-16 18:29:40,557 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2023-12-16 18:29:40,566 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2023-12-16 18:29:40,574 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2023-12-16 18:29:40,584 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2023-12-16 18:29:40,593 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2023-12-16 18:29:40,601 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2023-12-16 18:29:40,609 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2023-12-16 18:29:40,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2023-12-16 18:29:40,625 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2023-12-16 18:29:40,633 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2023-12-16 18:29:40,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:29:40,693 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 18:29:40,868 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80190,80203] [2023-12-16 18:29:40,915 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115653,115666] [2023-12-16 18:29:40,939 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133417,133430] [2023-12-16 18:29:40,951 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142316,142329] [2023-12-16 18:29:40,958 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[146749,146762] [2023-12-16 18:29:40,964 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151062,151075] [2023-12-16 18:29:41,008 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[185818,185831] [2023-12-16 18:29:41,041 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203409,203422] [2023-12-16 18:29:41,060 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212345,212358] [2023-12-16 18:29:41,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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[216815,216828] [2023-12-16 18:29:41,073 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221165,221178] [2023-12-16 18:29:41,128 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240022,240035] [2023-12-16 18:29:41,142 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[248958,248971] [2023-12-16 18:29:41,149 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253428,253441] [2023-12-16 18:29:41,155 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[257778,257791] [2023-12-16 18:29:41,162 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[262743,262756] [2023-12-16 18:29:41,169 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267102,267115] [2023-12-16 18:29:41,175 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[271572,271585] [2023-12-16 18:29:41,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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[275922,275935] [2023-12-16 18:29:41,189 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[280508,280521] [2023-12-16 18:29:41,195 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285025,285038] [2023-12-16 18:29:41,202 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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[289491,289504] [2023-12-16 18:29:41,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 18:29:41,242 INFO L206 MainTranslator]: Completed translation [2023-12-16 18:29:41,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41 WrapperNode [2023-12-16 18:29:41,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 18:29:41,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 18:29:41,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 18:29:41,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 18:29:41,248 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:29:41" (1/1) ... [2023-12-16 18:29:41,301 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:29:41" (1/1) ... [2023-12-16 18:29:41,472 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13208 [2023-12-16 18:29:41,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 18:29:41,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 18:29:41,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 18:29:41,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 18:29:41,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,588 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:29:41,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 18:29:41,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 18:29:41,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 18:29:41,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 18:29:41,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (1/1) ... [2023-12-16 18:29:41,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 18:29:41,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 18:29:41,872 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:29:41,887 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:29:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 18:29:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 18:29:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 18:29:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 18:29:42,158 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 18:29:42,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 18:29:46,974 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 18:29:47,063 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 18:29:47,064 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 18:29:47,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:29:47 BoogieIcfgContainer [2023-12-16 18:29:47,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 18:29:47,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 18:29:47,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 18:29:47,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 18:29:47,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:29:39" (1/3) ... [2023-12-16 18:29:47,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa825f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:29:47, skipping insertion in model container [2023-12-16 18:29:47,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:29:41" (2/3) ... [2023-12-16 18:29:47,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa825f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:29:47, skipping insertion in model container [2023-12-16 18:29:47,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:29:47" (3/3) ... [2023-12-16 18:29:47,070 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2023-12-16 18:29:47,082 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 18:29:47,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-12-16 18:29:47,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 18:29:47,154 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;@327fb0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 18:29:47,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-12-16 18:29:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 2539 states, 2516 states have (on average 1.7595389507154213) internal successors, (4427), 2538 states have internal predecessors, (4427), 0 states have call successors, (0), 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:29:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-16 18:29:47,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:47,186 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] [2023-12-16 18:29:47,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:47,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1286229050, now seen corresponding path program 1 times [2023-12-16 18:29:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235871196] [2023-12-16 18:29:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:47,200 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:29:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:47,203 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:29:47,229 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:29:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:47,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:47,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:48,148 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:29:48,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:48,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235871196] [2023-12-16 18:29:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235871196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437930807] [2023-12-16 18:29:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:48,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:48,180 INFO L87 Difference]: Start difference. First operand has 2539 states, 2516 states have (on average 1.7595389507154213) internal successors, (4427), 2538 states have internal predecessors, (4427), 0 states have call successors, (0), 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 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:50,140 INFO L93 Difference]: Finished difference Result 3312 states and 5679 transitions. [2023-12-16 18:29:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:50,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2023-12-16 18:29:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:50,158 INFO L225 Difference]: With dead ends: 3312 [2023-12-16 18:29:50,158 INFO L226 Difference]: Without dead ends: 2044 [2023-12-16 18:29:50,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:29:50,165 INFO L413 NwaCegarLoop]: 1890 mSDtfsCounter, 6864 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6864 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:50,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6864 Valid, 1898 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 18:29:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2023-12-16 18:29:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2023-12-16 18:29:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2022 states have (on average 1.301681503461919) internal successors, (2632), 2043 states have internal predecessors, (2632), 0 states have call successors, (0), 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:29:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2632 transitions. [2023-12-16 18:29:50,232 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2632 transitions. Word has length 86 [2023-12-16 18:29:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:50,232 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2632 transitions. [2023-12-16 18:29:50,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2632 transitions. [2023-12-16 18:29:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-16 18:29:50,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:50,236 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] [2023-12-16 18:29:50,244 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:29:50,441 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:29:50,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:50,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1819596958, now seen corresponding path program 1 times [2023-12-16 18:29:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332467012] [2023-12-16 18:29:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:50,443 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:29:50,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:50,467 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:29:50,510 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:29:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:50,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:50,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:51,086 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:29:51,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:51,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332467012] [2023-12-16 18:29:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332467012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:51,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269596731] [2023-12-16 18:29:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:51,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:51,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:51,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:51,145 INFO L87 Difference]: Start difference. First operand 2044 states and 2632 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:52,206 INFO L93 Difference]: Finished difference Result 2524 states and 3239 transitions. [2023-12-16 18:29:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2023-12-16 18:29:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:52,211 INFO L225 Difference]: With dead ends: 2524 [2023-12-16 18:29:52,211 INFO L226 Difference]: Without dead ends: 1514 [2023-12-16 18:29:52,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:29:52,213 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 3851 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3851 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:52,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3851 Valid, 966 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 18:29:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2023-12-16 18:29:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2023-12-16 18:29:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1492 states have (on average 1.3170241286863271) internal successors, (1965), 1513 states have internal predecessors, (1965), 0 states have call successors, (0), 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:29:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1965 transitions. [2023-12-16 18:29:52,230 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1965 transitions. Word has length 86 [2023-12-16 18:29:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:52,231 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 1965 transitions. [2023-12-16 18:29:52,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1965 transitions. [2023-12-16 18:29:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-16 18:29:52,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:52,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:29:52,241 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 (3)] Forceful destruction successful, exit code 0 [2023-12-16 18:29:52,438 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:29:52,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:52,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2017741702, now seen corresponding path program 1 times [2023-12-16 18:29:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:52,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966395292] [2023-12-16 18:29:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:52,440 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:29:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:52,441 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:29:52,445 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:29:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:52,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:52,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:53,060 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:29:53,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:53,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:53,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966395292] [2023-12-16 18:29:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966395292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944805616] [2023-12-16 18:29:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:53,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:53,062 INFO L87 Difference]: Start difference. First operand 1514 states and 1965 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:53,929 INFO L93 Difference]: Finished difference Result 2090 states and 2715 transitions. [2023-12-16 18:29:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2023-12-16 18:29:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:53,933 INFO L225 Difference]: With dead ends: 2090 [2023-12-16 18:29:53,933 INFO L226 Difference]: Without dead ends: 1318 [2023-12-16 18:29:53,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:29:53,935 INFO L413 NwaCegarLoop]: 862 mSDtfsCounter, 5061 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5061 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:53,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5061 Valid, 874 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 18:29:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2023-12-16 18:29:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2023-12-16 18:29:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1296 states have (on average 1.3302469135802468) internal successors, (1724), 1317 states have internal predecessors, (1724), 0 states have call successors, (0), 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:29:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1724 transitions. [2023-12-16 18:29:53,951 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1724 transitions. Word has length 86 [2023-12-16 18:29:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:53,951 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1724 transitions. [2023-12-16 18:29:53,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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:29:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1724 transitions. [2023-12-16 18:29:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 18:29:53,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:53,953 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] [2023-12-16 18:29:53,971 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 18:29:54,158 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:29:54,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:54,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 309558150, now seen corresponding path program 1 times [2023-12-16 18:29:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248326733] [2023-12-16 18:29:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:54,160 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:29:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:54,161 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:29:54,208 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:29:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:54,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:54,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:54,807 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:29:54,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:54,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248326733] [2023-12-16 18:29:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248326733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721407230] [2023-12-16 18:29:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:54,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:54,825 INFO L87 Difference]: Start difference. First operand 1318 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:55,510 INFO L93 Difference]: Finished difference Result 1654 states and 2137 transitions. [2023-12-16 18:29:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:55,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-12-16 18:29:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:55,513 INFO L225 Difference]: With dead ends: 1654 [2023-12-16 18:29:55,513 INFO L226 Difference]: Without dead ends: 1007 [2023-12-16 18:29:55,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 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:29:55,515 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 2550 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:55,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 693 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 18:29:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-12-16 18:29:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2023-12-16 18:29:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 985 states have (on average 1.3380710659898478) internal successors, (1318), 1006 states have internal predecessors, (1318), 0 states have call successors, (0), 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:29:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1318 transitions. [2023-12-16 18:29:55,526 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1318 transitions. Word has length 88 [2023-12-16 18:29:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:55,526 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1318 transitions. [2023-12-16 18:29:55,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1318 transitions. [2023-12-16 18:29:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-16 18:29:55,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:55,528 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] [2023-12-16 18:29:55,546 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:29:55,732 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:29:55,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:55,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2029023464, now seen corresponding path program 1 times [2023-12-16 18:29:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096355514] [2023-12-16 18:29:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:55,734 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:29:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:55,743 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:29:55,793 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:29:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:56,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:56,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:56,304 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:29:56,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:56,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096355514] [2023-12-16 18:29:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096355514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:56,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468017353] [2023-12-16 18:29:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:56,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:56,306 INFO L87 Difference]: Start difference. First operand 1007 states and 1318 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:56,755 INFO L93 Difference]: Finished difference Result 1197 states and 1536 transitions. [2023-12-16 18:29:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-12-16 18:29:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:56,758 INFO L225 Difference]: With dead ends: 1197 [2023-12-16 18:29:56,758 INFO L226 Difference]: Without dead ends: 709 [2023-12-16 18:29:56,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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:29:56,762 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 1755 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:56,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 535 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 18:29:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-16 18:29:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2023-12-16 18:29:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 687 states have (on average 1.3449781659388647) internal successors, (924), 708 states have internal predecessors, (924), 0 states have call successors, (0), 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:29:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 924 transitions. [2023-12-16 18:29:56,771 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 924 transitions. Word has length 90 [2023-12-16 18:29:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:56,772 INFO L495 AbstractCegarLoop]: Abstraction has 709 states and 924 transitions. [2023-12-16 18:29:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 924 transitions. [2023-12-16 18:29:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-16 18:29:56,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:56,774 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] [2023-12-16 18:29:56,788 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 (6)] Ended with exit code 0 [2023-12-16 18:29:56,979 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:29:56,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:56,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1221939621, now seen corresponding path program 1 times [2023-12-16 18:29:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3905238] [2023-12-16 18:29:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:56,982 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:29:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:56,983 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:29:57,031 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:29:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:57,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 18:29:57,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:57,780 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:29:57,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:57,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3905238] [2023-12-16 18:29:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3905238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 18:29:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328174593] [2023-12-16 18:29:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 18:29:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 18:29:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 18:29:57,782 INFO L87 Difference]: Start difference. First operand 709 states and 924 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:29:58,346 INFO L93 Difference]: Finished difference Result 1087 states and 1422 transitions. [2023-12-16 18:29:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 18:29:58,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-12-16 18:29:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:29:58,348 INFO L225 Difference]: With dead ends: 1087 [2023-12-16 18:29:58,348 INFO L226 Difference]: Without dead ends: 701 [2023-12-16 18:29:58,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 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:29:58,350 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 2567 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:29:58,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 480 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 18:29:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-12-16 18:29:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2023-12-16 18:29:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.346097201767305) internal successors, (914), 700 states have internal predecessors, (914), 0 states have call successors, (0), 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:29:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 914 transitions. [2023-12-16 18:29:58,374 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 914 transitions. Word has length 92 [2023-12-16 18:29:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:29:58,375 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 914 transitions. [2023-12-16 18:29:58,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:29:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 914 transitions. [2023-12-16 18:29:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 18:29:58,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:29:58,376 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] [2023-12-16 18:29:58,383 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 (7)] Ended with exit code 0 [2023-12-16 18:29:58,582 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:29:58,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:29:58,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:29:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1346771176, now seen corresponding path program 1 times [2023-12-16 18:29:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:29:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088897862] [2023-12-16 18:29:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:29:58,585 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:29:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:29:58,586 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:29:58,587 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:29:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:29:58,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 18:29:58,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:29:59,381 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:29:59,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:29:59,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:29:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088897862] [2023-12-16 18:29:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088897862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:29:59,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:29:59,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 18:29:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188675884] [2023-12-16 18:29:59,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:29:59,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 18:29:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:29:59,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 18:29:59,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 18:29:59,383 INFO L87 Difference]: Start difference. First operand 701 states and 914 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:01,021 INFO L93 Difference]: Finished difference Result 1080 states and 1412 transitions. [2023-12-16 18:30:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 18:30:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-12-16 18:30:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:01,024 INFO L225 Difference]: With dead ends: 1080 [2023-12-16 18:30:01,024 INFO L226 Difference]: Without dead ends: 701 [2023-12-16 18:30:01,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 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:30:01,025 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 3439 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:01,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 916 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:30:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-12-16 18:30:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2023-12-16 18:30:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3446244477172313) internal successors, (913), 700 states have internal predecessors, (913), 0 states have call successors, (0), 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:30:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 913 transitions. [2023-12-16 18:30:01,032 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 913 transitions. Word has length 94 [2023-12-16 18:30:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:01,032 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 913 transitions. [2023-12-16 18:30:01,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 913 transitions. [2023-12-16 18:30:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 18:30:01,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:01,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:30:01,054 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:30:01,237 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:30:01,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:01,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1574448360, now seen corresponding path program 1 times [2023-12-16 18:30:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640040042] [2023-12-16 18:30:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:01,238 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:30:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:01,239 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:30:01,272 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:30:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:01,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:01,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:02,039 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:30:02,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:02,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640040042] [2023-12-16 18:30:02,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640040042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688604135] [2023-12-16 18:30:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:02,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:02,041 INFO L87 Difference]: Start difference. First operand 701 states and 913 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:03,645 INFO L93 Difference]: Finished difference Result 985 states and 1311 transitions. [2023-12-16 18:30:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:03,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-12-16 18:30:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:03,647 INFO L225 Difference]: With dead ends: 985 [2023-12-16 18:30:03,647 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:03,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 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:30:03,648 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 2526 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:03,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 1873 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:30:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3431516936671575) internal successors, (912), 700 states have internal predecessors, (912), 0 states have call successors, (0), 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:30:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 912 transitions. [2023-12-16 18:30:03,656 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 912 transitions. Word has length 94 [2023-12-16 18:30:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:03,656 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 912 transitions. [2023-12-16 18:30:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 912 transitions. [2023-12-16 18:30:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 18:30:03,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:03,658 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] [2023-12-16 18:30:03,666 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:30:03,862 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:30:03,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:03,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash -53559704, now seen corresponding path program 1 times [2023-12-16 18:30:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230313285] [2023-12-16 18:30:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:03,863 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:30:03,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:03,864 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:30:03,899 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:30:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:04,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:04,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:04,620 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:30:04,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:04,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230313285] [2023-12-16 18:30:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230313285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554021443] [2023-12-16 18:30:04,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:04,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:04,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:04,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:04,621 INFO L87 Difference]: Start difference. First operand 701 states and 912 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:06,325 INFO L93 Difference]: Finished difference Result 909 states and 1210 transitions. [2023-12-16 18:30:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-12-16 18:30:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:06,327 INFO L225 Difference]: With dead ends: 909 [2023-12-16 18:30:06,328 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:06,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 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:30:06,328 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 2345 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:06,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 1974 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3416789396170838) internal successors, (911), 700 states have internal predecessors, (911), 0 states have call successors, (0), 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:30:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 911 transitions. [2023-12-16 18:30:06,336 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 911 transitions. Word has length 94 [2023-12-16 18:30:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:06,336 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 911 transitions. [2023-12-16 18:30:06,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 911 transitions. [2023-12-16 18:30:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 18:30:06,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:06,337 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] [2023-12-16 18:30:06,342 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:30:06,542 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:30:06,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:06,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash 339408658, now seen corresponding path program 1 times [2023-12-16 18:30:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172254048] [2023-12-16 18:30:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:06,543 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:30:06,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:06,544 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:30:06,546 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:30:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:06,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:06,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:07,310 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:30:07,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:07,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172254048] [2023-12-16 18:30:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172254048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943464835] [2023-12-16 18:30:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:07,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:07,312 INFO L87 Difference]: Start difference. First operand 701 states and 911 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:09,122 INFO L93 Difference]: Finished difference Result 875 states and 1164 transitions. [2023-12-16 18:30:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-12-16 18:30:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:09,125 INFO L225 Difference]: With dead ends: 875 [2023-12-16 18:30:09,125 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:09,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 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:30:09,126 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 2945 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2945 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:09,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2945 Valid, 2131 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3402061855670102) internal successors, (910), 700 states have internal predecessors, (910), 0 states have call successors, (0), 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:30:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 910 transitions. [2023-12-16 18:30:09,133 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 910 transitions. Word has length 95 [2023-12-16 18:30:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:09,134 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 910 transitions. [2023-12-16 18:30:09,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 910 transitions. [2023-12-16 18:30:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:09,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:09,135 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] [2023-12-16 18:30:09,148 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 (11)] Ended with exit code 0 [2023-12-16 18:30:09,339 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:30:09,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:09,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1249049709, now seen corresponding path program 1 times [2023-12-16 18:30:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258286210] [2023-12-16 18:30:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:09,340 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:30:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:09,347 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:30:09,348 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:30:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:09,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:09,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:10,204 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:30:10,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:10,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258286210] [2023-12-16 18:30:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258286210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863385702] [2023-12-16 18:30:10,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:10,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:10,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:10,206 INFO L87 Difference]: Start difference. First operand 701 states and 910 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:11,924 INFO L93 Difference]: Finished difference Result 1015 states and 1335 transitions. [2023-12-16 18:30:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:11,929 INFO L225 Difference]: With dead ends: 1015 [2023-12-16 18:30:11,929 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:11,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:11,933 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 2344 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:11,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 2023 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3387334315169366) internal successors, (909), 700 states have internal predecessors, (909), 0 states have call successors, (0), 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:30:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 909 transitions. [2023-12-16 18:30:11,954 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 909 transitions. Word has length 96 [2023-12-16 18:30:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:11,954 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 909 transitions. [2023-12-16 18:30:11,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 909 transitions. [2023-12-16 18:30:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:11,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:11,956 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] [2023-12-16 18:30:11,968 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:30:12,168 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:30:12,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:12,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1573191597, now seen corresponding path program 1 times [2023-12-16 18:30:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330769137] [2023-12-16 18:30:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:12,169 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:30:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:12,170 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:30:12,172 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:30:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:12,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:12,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:13,014 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:30:13,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:13,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330769137] [2023-12-16 18:30:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330769137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340885210] [2023-12-16 18:30:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:13,016 INFO L87 Difference]: Start difference. First operand 701 states and 909 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:14,802 INFO L93 Difference]: Finished difference Result 880 states and 1166 transitions. [2023-12-16 18:30:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:14,804 INFO L225 Difference]: With dead ends: 880 [2023-12-16 18:30:14,804 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:14,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:14,805 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 2890 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:14,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 2175 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.337260677466863) internal successors, (908), 700 states have internal predecessors, (908), 0 states have call successors, (0), 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:30:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 908 transitions. [2023-12-16 18:30:14,812 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 908 transitions. Word has length 96 [2023-12-16 18:30:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:14,812 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 908 transitions. [2023-12-16 18:30:14,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 908 transitions. [2023-12-16 18:30:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:14,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:14,813 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] [2023-12-16 18:30:14,817 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 (13)] Ended with exit code 0 [2023-12-16 18:30:15,017 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:30:15,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:15,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 474771949, now seen corresponding path program 1 times [2023-12-16 18:30:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377011314] [2023-12-16 18:30:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:15,019 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:30:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:15,021 INFO L229 MonitoredProcess]: Starting monitored process 14 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:30:15,024 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 (14)] Waiting until timeout for monitored process [2023-12-16 18:30:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:15,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:15,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:15,919 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:30:15,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:15,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377011314] [2023-12-16 18:30:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377011314] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852981756] [2023-12-16 18:30:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:15,921 INFO L87 Difference]: Start difference. First operand 701 states and 908 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:17,765 INFO L93 Difference]: Finished difference Result 923 states and 1217 transitions. [2023-12-16 18:30:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:17,768 INFO L225 Difference]: With dead ends: 923 [2023-12-16 18:30:17,768 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:17,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:17,768 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 2132 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:17,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 2147 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3357879234167893) internal successors, (907), 700 states have internal predecessors, (907), 0 states have call successors, (0), 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:30:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 907 transitions. [2023-12-16 18:30:17,793 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 907 transitions. Word has length 96 [2023-12-16 18:30:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 907 transitions. [2023-12-16 18:30:17,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 907 transitions. [2023-12-16 18:30:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:17,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:17,794 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] [2023-12-16 18:30:17,812 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:17,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:30:17,995 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:17,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash 87823981, now seen corresponding path program 1 times [2023-12-16 18:30:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553660582] [2023-12-16 18:30:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:17,996 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:30:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:17,999 INFO L229 MonitoredProcess]: Starting monitored process 15 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:30:18,000 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 (15)] Waiting until timeout for monitored process [2023-12-16 18:30:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:18,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:18,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:18,761 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:30:18,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:18,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553660582] [2023-12-16 18:30:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553660582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784932173] [2023-12-16 18:30:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:18,762 INFO L87 Difference]: Start difference. First operand 701 states and 907 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:20,520 INFO L93 Difference]: Finished difference Result 880 states and 1164 transitions. [2023-12-16 18:30:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:20,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:20,522 INFO L225 Difference]: With dead ends: 880 [2023-12-16 18:30:20,522 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:20,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:20,523 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 2883 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:20,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 2175 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3343151693667157) internal successors, (906), 700 states have internal predecessors, (906), 0 states have call successors, (0), 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:30:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 906 transitions. [2023-12-16 18:30:20,549 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 906 transitions. Word has length 96 [2023-12-16 18:30:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:20,549 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 906 transitions. [2023-12-16 18:30:20,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 906 transitions. [2023-12-16 18:30:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:20,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:20,550 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] [2023-12-16 18:30:20,557 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 (15)] Ended with exit code 0 [2023-12-16 18:30:20,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:30:20,751 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:20,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1301641659, now seen corresponding path program 1 times [2023-12-16 18:30:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316386134] [2023-12-16 18:30:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:20,752 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:30:20,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:20,753 INFO L229 MonitoredProcess]: Starting monitored process 16 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:30:20,754 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 (16)] Waiting until timeout for monitored process [2023-12-16 18:30:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:21,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:21,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:21,591 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:30:21,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:21,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316386134] [2023-12-16 18:30:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316386134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099376185] [2023-12-16 18:30:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:21,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:21,593 INFO L87 Difference]: Start difference. First operand 701 states and 906 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:23,417 INFO L93 Difference]: Finished difference Result 860 states and 1138 transitions. [2023-12-16 18:30:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:23,419 INFO L225 Difference]: With dead ends: 860 [2023-12-16 18:30:23,419 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:23,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:23,421 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 2099 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:23,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 2098 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.332842415316642) internal successors, (905), 700 states have internal predecessors, (905), 0 states have call successors, (0), 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:30:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 905 transitions. [2023-12-16 18:30:23,451 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 905 transitions. Word has length 96 [2023-12-16 18:30:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:23,451 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 905 transitions. [2023-12-16 18:30:23,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 905 transitions. [2023-12-16 18:30:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:23,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:23,452 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] [2023-12-16 18:30:23,471 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 (16)] Ended with exit code 0 [2023-12-16 18:30:23,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:30:23,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:23,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1905411411, now seen corresponding path program 1 times [2023-12-16 18:30:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260184589] [2023-12-16 18:30:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:23,654 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:30:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:23,655 INFO L229 MonitoredProcess]: Starting monitored process 17 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:30:23,688 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 (17)] Waiting until timeout for monitored process [2023-12-16 18:30:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:24,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:24,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:24,541 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:30:24,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:24,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260184589] [2023-12-16 18:30:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260184589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:24,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851707556] [2023-12-16 18:30:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:24,543 INFO L87 Difference]: Start difference. First operand 701 states and 905 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:26,202 INFO L93 Difference]: Finished difference Result 923 states and 1217 transitions. [2023-12-16 18:30:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:26,204 INFO L225 Difference]: With dead ends: 923 [2023-12-16 18:30:26,204 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:26,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:26,205 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 2315 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2315 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2315 Valid, 2001 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:30:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3313696612665684) internal successors, (904), 700 states have internal predecessors, (904), 0 states have call successors, (0), 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:30:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 904 transitions. [2023-12-16 18:30:26,211 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 904 transitions. Word has length 96 [2023-12-16 18:30:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 904 transitions. [2023-12-16 18:30:26,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 904 transitions. [2023-12-16 18:30:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 18:30:26,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:26,216 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] [2023-12-16 18:30:26,220 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 (17)] Ended with exit code 0 [2023-12-16 18:30:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:30:26,421 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:26,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1768372077, now seen corresponding path program 1 times [2023-12-16 18:30:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564813051] [2023-12-16 18:30:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:26,421 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:30:26,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:26,422 INFO L229 MonitoredProcess]: Starting monitored process 18 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:30:26,424 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 (18)] Waiting until timeout for monitored process [2023-12-16 18:30:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:26,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:26,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:27,151 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:30:27,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:27,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:27,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564813051] [2023-12-16 18:30:27,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564813051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:27,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:27,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196224182] [2023-12-16 18:30:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:27,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:27,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:27,153 INFO L87 Difference]: Start difference. First operand 701 states and 904 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:28,952 INFO L93 Difference]: Finished difference Result 880 states and 1162 transitions. [2023-12-16 18:30:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 18:30:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:28,955 INFO L225 Difference]: With dead ends: 880 [2023-12-16 18:30:28,955 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:28,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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:30:28,955 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 2052 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:28,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 2172 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3298969072164948) internal successors, (903), 700 states have internal predecessors, (903), 0 states have call successors, (0), 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:30:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 903 transitions. [2023-12-16 18:30:28,961 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 903 transitions. Word has length 96 [2023-12-16 18:30:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:28,962 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 903 transitions. [2023-12-16 18:30:28,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 903 transitions. [2023-12-16 18:30:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 18:30:28,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:28,963 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] [2023-12-16 18:30:28,967 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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:30:29,163 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:29,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 372640941, now seen corresponding path program 1 times [2023-12-16 18:30:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485749947] [2023-12-16 18:30:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:29,164 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:30:29,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:29,165 INFO L229 MonitoredProcess]: Starting monitored process 19 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:30:29,167 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 (19)] Waiting until timeout for monitored process [2023-12-16 18:30:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:29,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:29,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:29,931 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:30:29,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:29,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:29,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485749947] [2023-12-16 18:30:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485749947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:29,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:29,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:29,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117563586] [2023-12-16 18:30:29,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:29,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:29,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:29,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:29,933 INFO L87 Difference]: Start difference. First operand 701 states and 903 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:31,770 INFO L93 Difference]: Finished difference Result 861 states and 1136 transitions. [2023-12-16 18:30:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-16 18:30:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:31,773 INFO L225 Difference]: With dead ends: 861 [2023-12-16 18:30:31,773 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:31,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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:30:31,773 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 2882 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2882 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:31,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2882 Valid, 2133 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3284241531664212) internal successors, (902), 700 states have internal predecessors, (902), 0 states have call successors, (0), 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:30:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 902 transitions. [2023-12-16 18:30:31,779 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 902 transitions. Word has length 97 [2023-12-16 18:30:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:31,779 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 902 transitions. [2023-12-16 18:30:31,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 902 transitions. [2023-12-16 18:30:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 18:30:31,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:31,781 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] [2023-12-16 18:30:31,803 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 (19)] Ended with exit code 0 [2023-12-16 18:30:31,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:30:31,981 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:31,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 620938253, now seen corresponding path program 1 times [2023-12-16 18:30:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898099293] [2023-12-16 18:30:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:31,982 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:30:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:31,983 INFO L229 MonitoredProcess]: Starting monitored process 20 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:30:31,986 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 (20)] Waiting until timeout for monitored process [2023-12-16 18:30:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:32,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:32,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:32,812 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:30:32,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:32,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898099293] [2023-12-16 18:30:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898099293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723940062] [2023-12-16 18:30:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:32,813 INFO L87 Difference]: Start difference. First operand 701 states and 902 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:34,754 INFO L93 Difference]: Finished difference Result 861 states and 1135 transitions. [2023-12-16 18:30:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-16 18:30:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:34,757 INFO L225 Difference]: With dead ends: 861 [2023-12-16 18:30:34,757 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:34,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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:30:34,758 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 2879 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:34,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2133 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 18:30:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3269513991163475) internal successors, (901), 700 states have internal predecessors, (901), 0 states have call successors, (0), 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:30:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 901 transitions. [2023-12-16 18:30:34,764 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 901 transitions. Word has length 97 [2023-12-16 18:30:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:34,764 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 901 transitions. [2023-12-16 18:30:34,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 901 transitions. [2023-12-16 18:30:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 18:30:34,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:34,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] [2023-12-16 18:30:34,779 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:34,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:30:34,970 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:34,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash 108985709, now seen corresponding path program 1 times [2023-12-16 18:30:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824879546] [2023-12-16 18:30:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:34,971 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:30:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:34,972 INFO L229 MonitoredProcess]: Starting monitored process 21 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:30:34,976 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 (21)] Waiting until timeout for monitored process [2023-12-16 18:30:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:35,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:35,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:35,809 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:30:35,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:35,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824879546] [2023-12-16 18:30:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824879546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962506932] [2023-12-16 18:30:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:35,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:35,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:35,813 INFO L87 Difference]: Start difference. First operand 701 states and 901 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:37,604 INFO L93 Difference]: Finished difference Result 861 states and 1134 transitions. [2023-12-16 18:30:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-16 18:30:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:37,606 INFO L225 Difference]: With dead ends: 861 [2023-12-16 18:30:37,606 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:37,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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:30:37,607 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 2876 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2876 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:37,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2876 Valid, 2133 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3254786450662739) internal successors, (900), 700 states have internal predecessors, (900), 0 states have call successors, (0), 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:30:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 900 transitions. [2023-12-16 18:30:37,613 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 900 transitions. Word has length 97 [2023-12-16 18:30:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:37,613 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 900 transitions. [2023-12-16 18:30:37,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 900 transitions. [2023-12-16 18:30:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 18:30:37,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:37,614 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] [2023-12-16 18:30:37,626 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 (21)] Ended with exit code 0 [2023-12-16 18:30:37,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:30:37,826 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:37,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -670035859, now seen corresponding path program 1 times [2023-12-16 18:30:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497169280] [2023-12-16 18:30:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:37,827 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:30:37,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:37,828 INFO L229 MonitoredProcess]: Starting monitored process 22 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:30:37,862 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 (22)] Waiting until timeout for monitored process [2023-12-16 18:30:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:38,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:38,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:38,745 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:30:38,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:38,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497169280] [2023-12-16 18:30:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497169280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:38,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:38,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247313804] [2023-12-16 18:30:38,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:38,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:38,747 INFO L87 Difference]: Start difference. First operand 701 states and 900 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:40,636 INFO L93 Difference]: Finished difference Result 852 states and 1121 transitions. [2023-12-16 18:30:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-16 18:30:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:40,638 INFO L225 Difference]: With dead ends: 852 [2023-12-16 18:30:40,638 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:40,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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:30:40,639 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 2707 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:40,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2707 Valid, 1999 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3240058910162003) internal successors, (899), 700 states have internal predecessors, (899), 0 states have call successors, (0), 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:30:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 899 transitions. [2023-12-16 18:30:40,645 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 899 transitions. Word has length 97 [2023-12-16 18:30:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:40,645 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 899 transitions. [2023-12-16 18:30:40,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 899 transitions. [2023-12-16 18:30:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 18:30:40,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:40,646 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] [2023-12-16 18:30:40,672 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:40,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:30:40,847 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:40,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1155193037, now seen corresponding path program 1 times [2023-12-16 18:30:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281019372] [2023-12-16 18:30:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:40,848 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:30:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:40,848 INFO L229 MonitoredProcess]: Starting monitored process 23 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:30:40,884 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 (23)] Waiting until timeout for monitored process [2023-12-16 18:30:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:41,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:41,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:41,647 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:30:41,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:41,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281019372] [2023-12-16 18:30:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281019372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250222431] [2023-12-16 18:30:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:41,648 INFO L87 Difference]: Start difference. First operand 701 states and 899 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:43,548 INFO L93 Difference]: Finished difference Result 861 states and 1132 transitions. [2023-12-16 18:30:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-16 18:30:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:43,550 INFO L225 Difference]: With dead ends: 861 [2023-12-16 18:30:43,550 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:43,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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:30:43,551 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 2057 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:43,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 2132 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 18:30:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3225331369661266) internal successors, (898), 700 states have internal predecessors, (898), 0 states have call successors, (0), 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:30:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 898 transitions. [2023-12-16 18:30:43,557 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 898 transitions. Word has length 97 [2023-12-16 18:30:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:43,557 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 898 transitions. [2023-12-16 18:30:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 898 transitions. [2023-12-16 18:30:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 18:30:43,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:43,558 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] [2023-12-16 18:30:43,562 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 (23)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:30:43,762 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:43,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 789636914, now seen corresponding path program 1 times [2023-12-16 18:30:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770057617] [2023-12-16 18:30:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:43,763 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:30:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:43,764 INFO L229 MonitoredProcess]: Starting monitored process 24 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:30:43,765 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 (24)] Waiting until timeout for monitored process [2023-12-16 18:30:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:44,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:44,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:44,564 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:30:44,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:44,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:44,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770057617] [2023-12-16 18:30:44,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770057617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:44,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:44,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399178003] [2023-12-16 18:30:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:44,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:44,565 INFO L87 Difference]: Start difference. First operand 701 states and 898 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:46,295 INFO L93 Difference]: Finished difference Result 938 states and 1223 transitions. [2023-12-16 18:30:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2023-12-16 18:30:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:46,297 INFO L225 Difference]: With dead ends: 938 [2023-12-16 18:30:46,297 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:46,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 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:30:46,298 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 2942 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:46,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 1978 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 18:30:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.321060382916053) internal successors, (897), 700 states have internal predecessors, (897), 0 states have call successors, (0), 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:30:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 897 transitions. [2023-12-16 18:30:46,304 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 897 transitions. Word has length 98 [2023-12-16 18:30:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:46,304 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 897 transitions. [2023-12-16 18:30:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 897 transitions. [2023-12-16 18:30:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 18:30:46,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:46,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 18:30:46,312 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 (24)] Ended with exit code 0 [2023-12-16 18:30:46,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:30:46,510 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:46,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1331918194, now seen corresponding path program 1 times [2023-12-16 18:30:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610389413] [2023-12-16 18:30:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:46,511 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:30:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:46,512 INFO L229 MonitoredProcess]: Starting monitored process 25 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:30:46,513 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 (25)] Waiting until timeout for monitored process [2023-12-16 18:30:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:46,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:46,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 18:30:47,282 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:30:47,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 18:30:47,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 18:30:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610389413] [2023-12-16 18:30:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610389413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 18:30:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 18:30:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 18:30:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761265542] [2023-12-16 18:30:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 18:30:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 18:30:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 18:30:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 18:30:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 18:30:47,284 INFO L87 Difference]: Start difference. First operand 701 states and 897 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 18:30:48,970 INFO L93 Difference]: Finished difference Result 889 states and 1163 transitions. [2023-12-16 18:30:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 18:30:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2023-12-16 18:30:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 18:30:48,972 INFO L225 Difference]: With dead ends: 889 [2023-12-16 18:30:48,972 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 18:30:48,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 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:30:48,973 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 2234 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 18:30:48,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 2022 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 18:30:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 18:30:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 701. [2023-12-16 18:30:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 679 states have (on average 1.3195876288659794) internal successors, (896), 700 states have internal predecessors, (896), 0 states have call successors, (0), 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:30:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 896 transitions. [2023-12-16 18:30:48,979 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 896 transitions. Word has length 98 [2023-12-16 18:30:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 18:30:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 896 transitions. [2023-12-16 18:30:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 18:30:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 896 transitions. [2023-12-16 18:30:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 18:30:48,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 18:30:48,980 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] [2023-12-16 18:30:48,984 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 (25)] Forceful destruction successful, exit code 0 [2023-12-16 18:30:49,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:30:49,184 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2023-12-16 18:30:49,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 18:30:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 826135346, now seen corresponding path program 1 times [2023-12-16 18:30:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 18:30:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938008439] [2023-12-16 18:30:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 18:30:49,185 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:30:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 18:30:49,186 INFO L229 MonitoredProcess]: Starting monitored process 26 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:30:49,187 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 (26)] Waiting until timeout for monitored process [2023-12-16 18:30:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 18:30:49,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 18:30:49,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-16 18:30:49,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 22 remaining) [2023-12-16 18:30:49,651 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 (26)] Ended with exit code 0 [2023-12-16 18:30:49,688 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 (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 18:30:49,689 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:30:49,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:30:49,851 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2023-12-16 18:30:49,852 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (19 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (18 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (15 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (14 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (13 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (12 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (11 of 22 remaining) [2023-12-16 18:30:49,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (10 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (9 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (8 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (7 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (6 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (5 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (4 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (3 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (2 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 22 remaining) [2023-12-16 18:30:49,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 22 remaining) [2023-12-16 18:30:49,857 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-16 18:30:49,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 18:30:49,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:30:49 BoogieIcfgContainer [2023-12-16 18:30:49,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 18:30:49,863 INFO L158 Benchmark]: Toolchain (without parser) took 70495.86ms. Allocated memory was 215.0MB in the beginning and 985.7MB in the end (delta: 770.7MB). Free memory was 144.7MB in the beginning and 641.0MB in the end (delta: -496.3MB). Peak memory consumption was 275.6MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,863 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 18:30:49,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1874.18ms. Allocated memory was 215.0MB in the beginning and 281.0MB in the end (delta: 66.1MB). Free memory was 144.5MB in the beginning and 194.3MB in the end (delta: -49.8MB). Peak memory consumption was 103.7MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 228.87ms. Allocated memory is still 281.0MB. Free memory was 194.3MB in the beginning and 201.6MB in the end (delta: -7.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,863 INFO L158 Benchmark]: Boogie Preprocessor took 350.47ms. Allocated memory is still 281.0MB. Free memory was 201.1MB in the beginning and 181.2MB in the end (delta: 19.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,863 INFO L158 Benchmark]: RCFGBuilder took 5240.35ms. Allocated memory was 281.0MB in the beginning and 712.0MB in the end (delta: 431.0MB). Free memory was 181.2MB in the beginning and 485.8MB in the end (delta: -304.6MB). Peak memory consumption was 244.3MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,864 INFO L158 Benchmark]: TraceAbstraction took 62796.19ms. Allocated memory was 712.0MB in the beginning and 985.7MB in the end (delta: 273.7MB). Free memory was 485.3MB in the beginning and 641.0MB in the end (delta: -155.7MB). Peak memory consumption was 118.5MB. Max. memory is 8.0GB. [2023-12-16 18:30:49,864 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.11ms. Allocated memory is still 215.0MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1874.18ms. Allocated memory was 215.0MB in the beginning and 281.0MB in the end (delta: 66.1MB). Free memory was 144.5MB in the beginning and 194.3MB in the end (delta: -49.8MB). Peak memory consumption was 103.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 228.87ms. Allocated memory is still 281.0MB. Free memory was 194.3MB in the beginning and 201.6MB in the end (delta: -7.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 350.47ms. Allocated memory is still 281.0MB. Free memory was 201.1MB in the beginning and 181.2MB in the end (delta: 19.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * RCFGBuilder took 5240.35ms. Allocated memory was 281.0MB in the beginning and 712.0MB in the end (delta: 431.0MB). Free memory was 181.2MB in the beginning and 485.8MB in the end (delta: -304.6MB). Peak memory consumption was 244.3MB. Max. memory is 8.0GB. * TraceAbstraction took 62796.19ms. Allocated memory was 712.0MB in the beginning and 985.7MB in the end (delta: 273.7MB). Free memory was 485.3MB in the beginning and 641.0MB in the end (delta: -155.7MB). Peak memory consumption was 118.5MB. 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: 13473]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13473). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 5691]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5691). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 8312]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8312). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 9612]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9612). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 10257]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10257). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 10577]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10577). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 10882]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 10882). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 14762]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14762). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 15408]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15408). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 15729]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15729). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 16035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16035). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 17401]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17401). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 18047]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 18047). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 18368]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 18368). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 18674]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 18674). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 19031]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19031). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 19347]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19347). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 19668]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19668). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 19974]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19974). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 20305]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20305). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 20616]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20616). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 20932]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 20932). Cancelled while NwaCegarLoop was analyzing trace of length 99 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2539 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 62.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69195 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69195 mSDsluCounter, 41661 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26250 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31484 IncrementalHoareTripleChecker+Invalid, 31777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 15411 mSDtfsCounter, 31484 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2363 GetRequests, 2109 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2539occurred in iteration=0, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1275 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2234 ConstructedInterpolants, 1453 QuantifiedInterpolants, 29594 SizeOfPredicates, 108 NumberOfNonLiveVariables, 13142 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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