/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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 10:25:14,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 10:25:14,690 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-25 10:25:14,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 10:25:14,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 10:25:14,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 10:25:14,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 10:25:14,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 10:25:14,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 10:25:14,728 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 10:25:14,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 10:25:14,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 10:25:14,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 10:25:14,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 10:25:14,731 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 10:25:14,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 10:25:14,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 10:25:14,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 10:25:14,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 10:25:14,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 10:25:14,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 10:25:14,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 10:25:14,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 10:25:14,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 10:25:14,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 10:25:14,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 10:25:14,734 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 10:25:14,734 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 10:25:14,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 10:25:14,735 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 10:25:14,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 10:25:14,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 10:25:14,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 10:25:14,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 10:25:14,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 10:25:14,738 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 10:25:14,738 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-25 10:25:14,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 10:25:14,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 10:25:15,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 10:25:15,002 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 10:25:15,002 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 10:25:15,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 10:25:16,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 10:25:16,529 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 10:25:16,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 10:25:16,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d55c5ad/4ab8a1517c01422b8885d58b14dd9355/FLAG1ee33452f [2023-12-25 10:25:16,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d55c5ad/4ab8a1517c01422b8885d58b14dd9355 [2023-12-25 10:25:16,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 10:25:16,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 10:25:16,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 10:25:16,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 10:25:16,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 10:25:16,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:25:16" (1/1) ... [2023-12-25 10:25:16,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78015ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:16, skipping insertion in model container [2023-12-25 10:25:16,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 10:25:16" (1/1) ... [2023-12-25 10:25:16,668 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 10:25:16,948 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2023-12-25 10:25:16,989 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2023-12-25 10:25:16,997 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2023-12-25 10:25:17,002 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2023-12-25 10:25:17,012 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2023-12-25 10:25:17,017 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2023-12-25 10:25:17,029 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2023-12-25 10:25:17,049 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2023-12-25 10:25:17,064 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2023-12-25 10:25:17,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2023-12-25 10:25:17,076 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2023-12-25 10:25:17,096 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2023-12-25 10:25:17,099 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2023-12-25 10:25:17,111 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2023-12-25 10:25:17,126 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2023-12-25 10:25:17,147 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2023-12-25 10:25:17,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 10:25:17,286 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 10:25:17,403 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2023-12-25 10:25:17,428 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2023-12-25 10:25:17,433 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2023-12-25 10:25:17,436 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2023-12-25 10:25:17,440 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2023-12-25 10:25:17,443 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2023-12-25 10:25:17,447 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2023-12-25 10:25:17,453 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2023-12-25 10:25:17,456 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2023-12-25 10:25:17,460 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2023-12-25 10:25:17,465 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2023-12-25 10:25:17,475 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2023-12-25 10:25:17,478 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2023-12-25 10:25:17,481 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2023-12-25 10:25:17,486 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2023-12-25 10:25:17,494 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2023-12-25 10:25:17,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 10:25:17,632 INFO L206 MainTranslator]: Completed translation [2023-12-25 10:25:17,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17 WrapperNode [2023-12-25 10:25:17,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 10:25:17,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 10:25:17,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 10:25:17,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 10:25:17,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,779 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3559 [2023-12-25 10:25:17,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 10:25:17,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 10:25:17,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 10:25:17,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 10:25:17,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,849 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-25 10:25:17,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 10:25:17,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 10:25:17,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 10:25:17,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 10:25:17,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (1/1) ... [2023-12-25 10:25:17,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 10:25:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 10:25:17,962 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-25 10:25:17,968 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-25 10:25:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 10:25:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 10:25:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 10:25:17,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 10:25:18,146 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 10:25:18,147 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 10:25:20,267 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 10:25:20,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 10:25:20,321 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 10:25:20,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:25:20 BoogieIcfgContainer [2023-12-25 10:25:20,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 10:25:20,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 10:25:20,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 10:25:20,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 10:25:20,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 10:25:16" (1/3) ... [2023-12-25 10:25:20,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e9d04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:25:20, skipping insertion in model container [2023-12-25 10:25:20,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 10:25:17" (2/3) ... [2023-12-25 10:25:20,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e9d04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 10:25:20, skipping insertion in model container [2023-12-25 10:25:20,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 10:25:20" (3/3) ... [2023-12-25 10:25:20,328 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 10:25:20,344 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 10:25:20,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-25 10:25:20,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 10:25:20,414 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;@5f073ca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 10:25:20,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-12-25 10:25:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 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-25 10:25:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 10:25:20,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:20,445 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] [2023-12-25 10:25:20,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:20,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1484817577, now seen corresponding path program 1 times [2023-12-25 10:25:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:20,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775764641] [2023-12-25 10:25:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:20,469 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-25 10:25:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:20,472 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-25 10:25:20,476 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-25 10:25:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:20,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:25:20,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:21,196 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-25 10:25:21,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:21,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775764641] [2023-12-25 10:25:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775764641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:21,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:25:21,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481623987] [2023-12-25 10:25:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:21,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:25:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:21,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:25:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:25:21,235 INFO L87 Difference]: Start difference. First operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 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 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-25 10:25:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:22,041 INFO L93 Difference]: Finished difference Result 1179 states and 2028 transitions. [2023-12-25 10:25:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:25:22,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2023-12-25 10:25:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:22,056 INFO L225 Difference]: With dead ends: 1179 [2023-12-25 10:25:22,056 INFO L226 Difference]: Without dead ends: 710 [2023-12-25 10:25:22,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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-25 10:25:22,072 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 3161 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3161 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:22,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3161 Valid, 804 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:25:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-12-25 10:25:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 650. [2023-12-25 10:25:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 634 states have (on average 1.3659305993690851) internal successors, (866), 649 states have internal predecessors, (866), 0 states have call successors, (0), 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-25 10:25:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2023-12-25 10:25:22,162 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 70 [2023-12-25 10:25:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:22,162 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2023-12-25 10:25:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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-25 10:25:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2023-12-25 10:25:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 10:25:22,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:22,166 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] [2023-12-25 10:25:22,176 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 (2)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:22,370 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-25 10:25:22,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:22,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash 23635309, now seen corresponding path program 1 times [2023-12-25 10:25:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050469361] [2023-12-25 10:25:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:22,372 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-25 10:25:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:22,374 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-25 10:25:22,377 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-25 10:25:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:22,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:25:22,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:22,834 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-25 10:25:22,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:22,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050469361] [2023-12-25 10:25:22,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050469361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:22,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:25:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360189474] [2023-12-25 10:25:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:22,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:25:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:22,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:25:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:25:22,838 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-25 10:25:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:23,191 INFO L93 Difference]: Finished difference Result 1139 states and 1556 transitions. [2023-12-25 10:25:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:25:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2023-12-25 10:25:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:23,194 INFO L225 Difference]: With dead ends: 1139 [2023-12-25 10:25:23,194 INFO L226 Difference]: Without dead ends: 589 [2023-12-25 10:25:23,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 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-25 10:25:23,196 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 1076 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:23,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 339 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:25:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2023-12-25 10:25:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2023-12-25 10:25:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 573 states have (on average 1.387434554973822) internal successors, (795), 588 states have internal predecessors, (795), 0 states have call successors, (0), 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-25 10:25:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 795 transitions. [2023-12-25 10:25:23,214 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 795 transitions. Word has length 71 [2023-12-25 10:25:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:23,215 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 795 transitions. [2023-12-25 10:25:23,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-25 10:25:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 795 transitions. [2023-12-25 10:25:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 10:25:23,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:23,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] [2023-12-25 10:25:23,227 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-25 10:25:23,420 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-25 10:25:23,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:23,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -445674710, now seen corresponding path program 1 times [2023-12-25 10:25:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288600841] [2023-12-25 10:25:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:23,423 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-25 10:25:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:23,424 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-25 10:25:23,449 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-25 10:25:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:23,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:25:23,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:23,866 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-25 10:25:23,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:23,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288600841] [2023-12-25 10:25:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288600841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:23,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:25:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589208212] [2023-12-25 10:25:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:25:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:25:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:25:23,868 INFO L87 Difference]: Start difference. First operand 589 states and 795 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-25 10:25:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:24,207 INFO L93 Difference]: Finished difference Result 1078 states and 1483 transitions. [2023-12-25 10:25:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:25:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2023-12-25 10:25:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:24,210 INFO L225 Difference]: With dead ends: 1078 [2023-12-25 10:25:24,210 INFO L226 Difference]: Without dead ends: 560 [2023-12-25 10:25:24,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-25 10:25:24,212 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1487 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:24,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 318 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:25:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-25 10:25:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2023-12-25 10:25:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 544 states have (on average 1.3970588235294117) internal successors, (760), 559 states have internal predecessors, (760), 0 states have call successors, (0), 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-25 10:25:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 760 transitions. [2023-12-25 10:25:24,224 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 760 transitions. Word has length 72 [2023-12-25 10:25:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:24,224 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 760 transitions. [2023-12-25 10:25:24,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-25 10:25:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 760 transitions. [2023-12-25 10:25:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 10:25:24,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:24,226 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] [2023-12-25 10:25:24,232 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-25 10:25:24,430 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-25 10:25:24,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:24,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash -891048818, now seen corresponding path program 1 times [2023-12-25 10:25:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265909397] [2023-12-25 10:25:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:24,433 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-25 10:25:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:24,434 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-25 10:25:24,435 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-25 10:25:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:24,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:25:24,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:24,885 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-25 10:25:24,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:24,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265909397] [2023-12-25 10:25:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265909397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:24,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:25:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997204247] [2023-12-25 10:25:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:24,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:25:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:25:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:25:24,888 INFO L87 Difference]: Start difference. First operand 560 states and 760 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-25 10:25:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:25,235 INFO L93 Difference]: Finished difference Result 1049 states and 1446 transitions. [2023-12-25 10:25:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:25:25,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2023-12-25 10:25:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:25,237 INFO L225 Difference]: With dead ends: 1049 [2023-12-25 10:25:25,237 INFO L226 Difference]: Without dead ends: 547 [2023-12-25 10:25:25,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 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-25 10:25:25,239 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 956 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:25,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 303 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:25:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-12-25 10:25:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2023-12-25 10:25:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.39924670433145) internal successors, (743), 546 states have internal predecessors, (743), 0 states have call successors, (0), 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-25 10:25:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 743 transitions. [2023-12-25 10:25:25,250 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 743 transitions. Word has length 73 [2023-12-25 10:25:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:25,250 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 743 transitions. [2023-12-25 10:25:25,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-25 10:25:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 743 transitions. [2023-12-25 10:25:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 10:25:25,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:25,252 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] [2023-12-25 10:25:25,259 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-25 10:25:25,455 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-25 10:25:25,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:25,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -759675733, now seen corresponding path program 1 times [2023-12-25 10:25:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158398168] [2023-12-25 10:25:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:25,457 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-25 10:25:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:25,458 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-25 10:25:25,459 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-25 10:25:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:25,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:25:25,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:25,818 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-25 10:25:25,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:25,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158398168] [2023-12-25 10:25:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158398168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:25:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077225097] [2023-12-25 10:25:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:25:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:25,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:25:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:25:25,821 INFO L87 Difference]: Start difference. First operand 547 states and 743 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-25 10:25:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:26,201 INFO L93 Difference]: Finished difference Result 1036 states and 1427 transitions. [2023-12-25 10:25:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 10:25:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2023-12-25 10:25:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:26,203 INFO L225 Difference]: With dead ends: 1036 [2023-12-25 10:25:26,204 INFO L226 Difference]: Without dead ends: 542 [2023-12-25 10:25:26,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 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-25 10:25:26,205 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 927 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 280 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 10:25:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-25 10:25:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2023-12-25 10:25:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.397338403041825) internal successors, (735), 541 states have internal predecessors, (735), 0 states have call successors, (0), 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-25 10:25:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 735 transitions. [2023-12-25 10:25:26,215 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 735 transitions. Word has length 74 [2023-12-25 10:25:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:26,215 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 735 transitions. [2023-12-25 10:25:26,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-25 10:25:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 735 transitions. [2023-12-25 10:25:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 10:25:26,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:26,217 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] [2023-12-25 10:25:26,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:26,421 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-25 10:25:26,421 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:26,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1130154961, now seen corresponding path program 1 times [2023-12-25 10:25:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82530712] [2023-12-25 10:25:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:26,423 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-25 10:25:26,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:26,424 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-25 10:25:26,426 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-25 10:25:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:26,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 10:25:26,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:26,902 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-25 10:25:26,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:26,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82530712] [2023-12-25 10:25:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82530712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 10:25:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267510625] [2023-12-25 10:25:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:26,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:25:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:25:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:25:26,904 INFO L87 Difference]: Start difference. First operand 542 states and 735 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:27,821 INFO L93 Difference]: Finished difference Result 816 states and 1111 transitions. [2023-12-25 10:25:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:25:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2023-12-25 10:25:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:27,824 INFO L225 Difference]: With dead ends: 816 [2023-12-25 10:25:27,824 INFO L226 Difference]: Without dead ends: 542 [2023-12-25 10:25:27,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 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-25 10:25:27,825 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1403 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:27,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 523 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:25:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-25 10:25:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2023-12-25 10:25:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3954372623574145) internal successors, (734), 541 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:25:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 734 transitions. [2023-12-25 10:25:27,835 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 734 transitions. Word has length 75 [2023-12-25 10:25:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:27,835 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 734 transitions. [2023-12-25 10:25:27,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 734 transitions. [2023-12-25 10:25:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 10:25:27,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:27,837 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] [2023-12-25 10:25:27,843 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-25 10:25:28,037 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-25 10:25:28,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:28,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 496363608, now seen corresponding path program 1 times [2023-12-25 10:25:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934602351] [2023-12-25 10:25:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:28,038 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-25 10:25:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:28,039 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-25 10:25:28,040 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-25 10:25:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:28,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:28,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:28,720 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-25 10:25:28,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:28,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934602351] [2023-12-25 10:25:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934602351] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666177577] [2023-12-25 10:25:28,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:28,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:28,722 INFO L87 Difference]: Start difference. First operand 542 states and 734 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:30,214 INFO L93 Difference]: Finished difference Result 920 states and 1251 transitions. [2023-12-25 10:25:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 10:25:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2023-12-25 10:25:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:30,217 INFO L225 Difference]: With dead ends: 920 [2023-12-25 10:25:30,217 INFO L226 Difference]: Without dead ends: 730 [2023-12-25 10:25:30,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 10:25:30,219 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 2665 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:30,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 1230 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 10:25:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2023-12-25 10:25:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 542. [2023-12-25 10:25:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3935361216730038) internal successors, (733), 541 states have internal predecessors, (733), 0 states have call successors, (0), 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-25 10:25:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 733 transitions. [2023-12-25 10:25:30,229 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 733 transitions. Word has length 75 [2023-12-25 10:25:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:30,229 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 733 transitions. [2023-12-25 10:25:30,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 733 transitions. [2023-12-25 10:25:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 10:25:30,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:30,231 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] [2023-12-25 10:25:30,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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:30,431 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-25 10:25:30,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:30,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1385408418, now seen corresponding path program 1 times [2023-12-25 10:25:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277602240] [2023-12-25 10:25:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:30,433 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-25 10:25:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:30,434 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-25 10:25:30,435 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-25 10:25:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:30,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:30,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:31,092 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-25 10:25:31,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:31,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277602240] [2023-12-25 10:25:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277602240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697976677] [2023-12-25 10:25:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:31,094 INFO L87 Difference]: Start difference. First operand 542 states and 733 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:32,266 INFO L93 Difference]: Finished difference Result 819 states and 1146 transitions. [2023-12-25 10:25:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:32,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2023-12-25 10:25:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:32,270 INFO L225 Difference]: With dead ends: 819 [2023-12-25 10:25:32,271 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:32,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 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-25 10:25:32,272 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 1230 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:32,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 1166 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.391634980988593) internal successors, (732), 541 states have internal predecessors, (732), 0 states have call successors, (0), 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-25 10:25:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2023-12-25 10:25:32,282 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 75 [2023-12-25 10:25:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:32,282 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2023-12-25 10:25:32,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 10:25:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2023-12-25 10:25:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:32,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:32,284 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] [2023-12-25 10:25:32,291 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-25 10:25:32,487 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-25 10:25:32,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:32,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -821108329, now seen corresponding path program 1 times [2023-12-25 10:25:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772530375] [2023-12-25 10:25:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:32,488 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-25 10:25:32,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:32,489 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-25 10:25:32,491 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-25 10:25:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:32,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:32,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:33,119 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-25 10:25:33,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:33,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:33,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772530375] [2023-12-25 10:25:33,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772530375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:33,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360366268] [2023-12-25 10:25:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:33,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:33,121 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:34,141 INFO L93 Difference]: Finished difference Result 828 states and 1154 transitions. [2023-12-25 10:25:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:34,143 INFO L225 Difference]: With dead ends: 828 [2023-12-25 10:25:34,143 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:34,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:34,144 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 1361 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:34,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1088 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:25:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3897338403041826) internal successors, (731), 541 states have internal predecessors, (731), 0 states have call successors, (0), 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-25 10:25:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 731 transitions. [2023-12-25 10:25:34,155 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 731 transitions. Word has length 77 [2023-12-25 10:25:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:34,155 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 731 transitions. [2023-12-25 10:25:34,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 731 transitions. [2023-12-25 10:25:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:34,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:34,156 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] [2023-12-25 10:25:34,165 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-25 10:25:34,359 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-25 10:25:34,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:34,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1229953557, now seen corresponding path program 1 times [2023-12-25 10:25:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368883561] [2023-12-25 10:25:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:34,361 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-25 10:25:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:34,362 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-25 10:25:34,364 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-25 10:25:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:34,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:34,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:34,983 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-25 10:25:34,984 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:34,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368883561] [2023-12-25 10:25:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368883561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173898501] [2023-12-25 10:25:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:34,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:34,986 INFO L87 Difference]: Start difference. First operand 542 states and 731 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:36,162 INFO L93 Difference]: Finished difference Result 806 states and 1126 transitions. [2023-12-25 10:25:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:36,164 INFO L225 Difference]: With dead ends: 806 [2023-12-25 10:25:36,165 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:36,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:36,165 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1177 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:36,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1205 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3878326996197718) internal successors, (730), 541 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:25:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 730 transitions. [2023-12-25 10:25:36,175 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 730 transitions. Word has length 77 [2023-12-25 10:25:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:36,175 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 730 transitions. [2023-12-25 10:25:36,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 730 transitions. [2023-12-25 10:25:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:36,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:36,176 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] [2023-12-25 10:25:36,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:36,382 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-25 10:25:36,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash -861851382, now seen corresponding path program 1 times [2023-12-25 10:25:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731696165] [2023-12-25 10:25:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:36,384 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-25 10:25:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:36,385 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-25 10:25:36,385 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-25 10:25:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:36,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:36,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:36,968 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-25 10:25:36,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:36,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:36,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731696165] [2023-12-25 10:25:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731696165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073097644] [2023-12-25 10:25:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:36,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:36,970 INFO L87 Difference]: Start difference. First operand 542 states and 730 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:38,064 INFO L93 Difference]: Finished difference Result 806 states and 1124 transitions. [2023-12-25 10:25:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:38,067 INFO L225 Difference]: With dead ends: 806 [2023-12-25 10:25:38,067 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:38,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:38,068 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1604 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:38,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 1207 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3859315589353611) internal successors, (729), 541 states have internal predecessors, (729), 0 states have call successors, (0), 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-25 10:25:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 729 transitions. [2023-12-25 10:25:38,077 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 729 transitions. Word has length 77 [2023-12-25 10:25:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:38,078 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 729 transitions. [2023-12-25 10:25:38,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 729 transitions. [2023-12-25 10:25:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:38,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:38,079 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] [2023-12-25 10:25:38,087 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-25 10:25:38,283 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-25 10:25:38,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:38,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1582421198, now seen corresponding path program 1 times [2023-12-25 10:25:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019132465] [2023-12-25 10:25:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:38,284 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-25 10:25:38,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:38,285 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-25 10:25:38,286 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-25 10:25:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:38,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:38,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:38,883 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-25 10:25:38,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:38,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:38,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019132465] [2023-12-25 10:25:38,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019132465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:38,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:38,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967637880] [2023-12-25 10:25:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:38,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:38,885 INFO L87 Difference]: Start difference. First operand 542 states and 729 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:40,064 INFO L93 Difference]: Finished difference Result 802 states and 1120 transitions. [2023-12-25 10:25:40,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:40,066 INFO L225 Difference]: With dead ends: 802 [2023-12-25 10:25:40,066 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:40,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:40,067 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1194 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:40,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1174 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3840304182509506) internal successors, (728), 541 states have internal predecessors, (728), 0 states have call successors, (0), 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-25 10:25:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 728 transitions. [2023-12-25 10:25:40,076 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 728 transitions. Word has length 77 [2023-12-25 10:25:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:40,076 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 728 transitions. [2023-12-25 10:25:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 728 transitions. [2023-12-25 10:25:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:40,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:40,077 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] [2023-12-25 10:25:40,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:40,281 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-25 10:25:40,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:40,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 981154930, now seen corresponding path program 1 times [2023-12-25 10:25:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024329692] [2023-12-25 10:25:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:40,282 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-25 10:25:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:40,283 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-25 10:25:40,284 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-25 10:25:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:40,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:40,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:40,835 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-25 10:25:40,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:40,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024329692] [2023-12-25 10:25:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024329692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983201808] [2023-12-25 10:25:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:40,838 INFO L87 Difference]: Start difference. First operand 542 states and 728 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:42,054 INFO L93 Difference]: Finished difference Result 986 states and 1333 transitions. [2023-12-25 10:25:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 10:25:42,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:42,056 INFO L225 Difference]: With dead ends: 986 [2023-12-25 10:25:42,056 INFO L226 Difference]: Without dead ends: 730 [2023-12-25 10:25:42,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 10:25:42,057 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 2044 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:42,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 1312 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2023-12-25 10:25:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 542. [2023-12-25 10:25:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3802281368821292) internal successors, (726), 541 states have internal predecessors, (726), 0 states have call successors, (0), 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-25 10:25:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 726 transitions. [2023-12-25 10:25:42,067 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 726 transitions. Word has length 77 [2023-12-25 10:25:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:42,067 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 726 transitions. [2023-12-25 10:25:42,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 726 transitions. [2023-12-25 10:25:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:42,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:42,068 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] [2023-12-25 10:25:42,076 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-25 10:25:42,272 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-25 10:25:42,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:42,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -817405268, now seen corresponding path program 1 times [2023-12-25 10:25:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934050362] [2023-12-25 10:25:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:42,273 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-25 10:25:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:42,275 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-25 10:25:42,275 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-25 10:25:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:42,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:42,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:42,928 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-25 10:25:42,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:42,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934050362] [2023-12-25 10:25:42,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934050362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:42,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829226823] [2023-12-25 10:25:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:42,930 INFO L87 Difference]: Start difference. First operand 542 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:44,008 INFO L93 Difference]: Finished difference Result 812 states and 1129 transitions. [2023-12-25 10:25:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:44,010 INFO L225 Difference]: With dead ends: 812 [2023-12-25 10:25:44,010 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:44,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:44,011 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1594 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:44,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1207 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:25:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.376425855513308) internal successors, (724), 541 states have internal predecessors, (724), 0 states have call successors, (0), 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-25 10:25:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 724 transitions. [2023-12-25 10:25:44,021 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 724 transitions. Word has length 77 [2023-12-25 10:25:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:44,021 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 724 transitions. [2023-12-25 10:25:44,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 724 transitions. [2023-12-25 10:25:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 10:25:44,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:44,022 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] [2023-12-25 10:25:44,028 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:44,225 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-25 10:25:44,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:44,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -408560040, now seen corresponding path program 1 times [2023-12-25 10:25:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951077185] [2023-12-25 10:25:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:44,227 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-25 10:25:44,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:44,227 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-25 10:25:44,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 (16)] Waiting until timeout for monitored process [2023-12-25 10:25:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:44,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:44,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:44,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-25 10:25:44,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:44,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951077185] [2023-12-25 10:25:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951077185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:44,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:44,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196591425] [2023-12-25 10:25:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:44,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:44,782 INFO L87 Difference]: Start difference. First operand 542 states and 724 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:45,818 INFO L93 Difference]: Finished difference Result 838 states and 1160 transitions. [2023-12-25 10:25:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2023-12-25 10:25:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:45,820 INFO L225 Difference]: With dead ends: 838 [2023-12-25 10:25:45,820 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:45,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 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-25 10:25:45,821 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 1621 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:45,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1204 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:25:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3726235741444868) internal successors, (722), 541 states have internal predecessors, (722), 0 states have call successors, (0), 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-25 10:25:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 722 transitions. [2023-12-25 10:25:45,829 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 722 transitions. Word has length 77 [2023-12-25 10:25:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:45,830 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 722 transitions. [2023-12-25 10:25:45,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 10:25:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 722 transitions. [2023-12-25 10:25:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:45,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:45,831 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] [2023-12-25 10:25:45,836 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:46,036 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-25 10:25:46,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:46,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1887565433, now seen corresponding path program 1 times [2023-12-25 10:25:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35354932] [2023-12-25 10:25:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:46,037 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-25 10:25:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:46,039 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-25 10:25:46,041 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-25 10:25:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:46,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:46,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:46,598 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-25 10:25:46,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:46,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35354932] [2023-12-25 10:25:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35354932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267889829] [2023-12-25 10:25:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:46,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:46,599 INFO L87 Difference]: Start difference. First operand 542 states and 722 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:47,711 INFO L93 Difference]: Finished difference Result 796 states and 1104 transitions. [2023-12-25 10:25:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:47,713 INFO L225 Difference]: With dead ends: 796 [2023-12-25 10:25:47,713 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:47,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:47,714 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 1193 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:47,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1156 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.370722433460076) internal successors, (721), 541 states have internal predecessors, (721), 0 states have call successors, (0), 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-25 10:25:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 721 transitions. [2023-12-25 10:25:47,723 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 721 transitions. Word has length 79 [2023-12-25 10:25:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:47,723 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 721 transitions. [2023-12-25 10:25:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 721 transitions. [2023-12-25 10:25:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:47,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:47,724 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] [2023-12-25 10:25:47,731 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:47,928 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-25 10:25:47,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:47,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1141656959, now seen corresponding path program 1 times [2023-12-25 10:25:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129674570] [2023-12-25 10:25:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:47,929 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-25 10:25:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:47,930 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-25 10:25:47,966 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-25 10:25:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:48,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:48,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:48,536 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-25 10:25:48,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:48,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:48,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129674570] [2023-12-25 10:25:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129674570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:48,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774317268] [2023-12-25 10:25:48,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:48,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:48,538 INFO L87 Difference]: Start difference. First operand 542 states and 721 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:49,709 INFO L93 Difference]: Finished difference Result 799 states and 1106 transitions. [2023-12-25 10:25:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:49,711 INFO L225 Difference]: With dead ends: 799 [2023-12-25 10:25:49,711 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:49,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:49,712 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1194 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:49,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1156 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3688212927756653) internal successors, (720), 541 states have internal predecessors, (720), 0 states have call successors, (0), 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-25 10:25:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 720 transitions. [2023-12-25 10:25:49,720 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 720 transitions. Word has length 79 [2023-12-25 10:25:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:49,720 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 720 transitions. [2023-12-25 10:25:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 720 transitions. [2023-12-25 10:25:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:49,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:49,722 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] [2023-12-25 10:25:49,725 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-25 10:25:49,925 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-25 10:25:49,925 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:49,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1896793534, now seen corresponding path program 1 times [2023-12-25 10:25:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253491845] [2023-12-25 10:25:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:49,926 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-25 10:25:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:49,927 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-25 10:25:49,928 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-25 10:25:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:50,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:50,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:50,525 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-25 10:25:50,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:50,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253491845] [2023-12-25 10:25:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253491845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87646700] [2023-12-25 10:25:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:50,527 INFO L87 Difference]: Start difference. First operand 542 states and 720 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:51,673 INFO L93 Difference]: Finished difference Result 799 states and 1105 transitions. [2023-12-25 10:25:51,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:51,675 INFO L225 Difference]: With dead ends: 799 [2023-12-25 10:25:51,675 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:51,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:51,676 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1610 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:51,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1156 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3669201520912548) internal successors, (719), 541 states have internal predecessors, (719), 0 states have call successors, (0), 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-25 10:25:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 719 transitions. [2023-12-25 10:25:51,685 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 719 transitions. Word has length 79 [2023-12-25 10:25:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:51,686 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 719 transitions. [2023-12-25 10:25:51,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 719 transitions. [2023-12-25 10:25:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:51,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:51,687 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] [2023-12-25 10:25:51,692 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 (19)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:51,891 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-25 10:25:51,891 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:51,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -485976660, now seen corresponding path program 1 times [2023-12-25 10:25:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:51,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028910311] [2023-12-25 10:25:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:51,892 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-25 10:25:51,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:51,893 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-25 10:25:51,894 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-25 10:25:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:52,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:52,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:52,508 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-25 10:25:52,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:52,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028910311] [2023-12-25 10:25:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028910311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627785029] [2023-12-25 10:25:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:52,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:52,510 INFO L87 Difference]: Start difference. First operand 542 states and 719 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:53,649 INFO L93 Difference]: Finished difference Result 811 states and 1118 transitions. [2023-12-25 10:25:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:53,651 INFO L225 Difference]: With dead ends: 811 [2023-12-25 10:25:53,651 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:53,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:53,651 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1584 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:53,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 1198 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3650190114068441) internal successors, (718), 541 states have internal predecessors, (718), 0 states have call successors, (0), 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-25 10:25:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 718 transitions. [2023-12-25 10:25:53,660 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 718 transitions. Word has length 79 [2023-12-25 10:25:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:53,660 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 718 transitions. [2023-12-25 10:25:53,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 718 transitions. [2023-12-25 10:25:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:53,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:53,661 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] [2023-12-25 10:25:53,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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:53,865 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-25 10:25:53,865 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:53,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash -328806928, now seen corresponding path program 1 times [2023-12-25 10:25:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11940559] [2023-12-25 10:25:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:53,866 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-25 10:25:53,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:53,867 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-25 10:25:53,868 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-25 10:25:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:54,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:54,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:54,447 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-25 10:25:54,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:54,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:54,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11940559] [2023-12-25 10:25:54,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11940559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:54,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:54,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371268844] [2023-12-25 10:25:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:54,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:54,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:54,449 INFO L87 Difference]: Start difference. First operand 542 states and 718 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:55,565 INFO L93 Difference]: Finished difference Result 796 states and 1100 transitions. [2023-12-25 10:25:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:55,567 INFO L225 Difference]: With dead ends: 796 [2023-12-25 10:25:55,567 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:55,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:55,568 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1601 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:55,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 1160 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3631178707224334) internal successors, (717), 541 states have internal predecessors, (717), 0 states have call successors, (0), 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-25 10:25:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 717 transitions. [2023-12-25 10:25:55,576 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 717 transitions. Word has length 79 [2023-12-25 10:25:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:55,576 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 717 transitions. [2023-12-25 10:25:55,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 717 transitions. [2023-12-25 10:25:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:55,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:55,578 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] [2023-12-25 10:25:55,584 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 10:25:55,781 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-25 10:25:55,782 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:55,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1594434658, now seen corresponding path program 1 times [2023-12-25 10:25:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211828546] [2023-12-25 10:25:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:55,783 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-25 10:25:55,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:55,784 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-25 10:25:55,785 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-25 10:25:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:55,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:55,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:56,362 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-25 10:25:56,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:56,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211828546] [2023-12-25 10:25:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211828546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:56,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:56,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947197149] [2023-12-25 10:25:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:56,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:56,363 INFO L87 Difference]: Start difference. First operand 542 states and 717 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:57,466 INFO L93 Difference]: Finished difference Result 673 states and 911 transitions. [2023-12-25 10:25:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:57,468 INFO L225 Difference]: With dead ends: 673 [2023-12-25 10:25:57,468 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:57,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:57,468 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1184 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:57,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1157 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.361216730038023) internal successors, (716), 541 states have internal predecessors, (716), 0 states have call successors, (0), 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-25 10:25:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 716 transitions. [2023-12-25 10:25:57,477 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 716 transitions. Word has length 79 [2023-12-25 10:25:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 716 transitions. [2023-12-25 10:25:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 716 transitions. [2023-12-25 10:25:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:57,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:57,478 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] [2023-12-25 10:25:57,482 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-25 10:25:57,681 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-25 10:25:57,682 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:57,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 319887148, now seen corresponding path program 1 times [2023-12-25 10:25:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:57,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146250094] [2023-12-25 10:25:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:57,683 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-25 10:25:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:57,684 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-25 10:25:57,684 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-25 10:25:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:57,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:57,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:25:58,224 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-25 10:25:58,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:25:58,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:25:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146250094] [2023-12-25 10:25:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146250094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:25:58,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:25:58,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:25:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452494202] [2023-12-25 10:25:58,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:25:58,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:25:58,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:25:58,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:25:58,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:25:58,226 INFO L87 Difference]: Start difference. First operand 542 states and 716 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:25:59,348 INFO L93 Difference]: Finished difference Result 796 states and 1098 transitions. [2023-12-25 10:25:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:25:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:25:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:25:59,351 INFO L225 Difference]: With dead ends: 796 [2023-12-25 10:25:59,351 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:25:59,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:25:59,352 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1180 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:25:59,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1160 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:25:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:25:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:25:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3593155893536122) internal successors, (715), 541 states have internal predecessors, (715), 0 states have call successors, (0), 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-25 10:25:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 715 transitions. [2023-12-25 10:25:59,359 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 715 transitions. Word has length 79 [2023-12-25 10:25:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:25:59,360 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 715 transitions. [2023-12-25 10:25:59,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:25:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 715 transitions. [2023-12-25 10:25:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:25:59,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:25:59,361 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] [2023-12-25 10:25:59,371 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-25 10:25:59,565 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-25 10:25:59,565 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:25:59,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:25:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1334706002, now seen corresponding path program 1 times [2023-12-25 10:25:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:25:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246681628] [2023-12-25 10:25:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:25:59,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:25:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:25:59,567 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-25 10:25:59,568 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-25 10:25:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:25:59,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:25:59,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:00,089 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-25 10:26:00,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:00,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246681628] [2023-12-25 10:26:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246681628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650067349] [2023-12-25 10:26:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:00,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:00,090 INFO L87 Difference]: Start difference. First operand 542 states and 715 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:01,179 INFO L93 Difference]: Finished difference Result 794 states and 1095 transitions. [2023-12-25 10:26:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:01,181 INFO L225 Difference]: With dead ends: 794 [2023-12-25 10:26:01,181 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:01,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:01,182 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 1480 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:01,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1157 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:26:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3574144486692015) internal successors, (714), 541 states have internal predecessors, (714), 0 states have call successors, (0), 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-25 10:26:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 714 transitions. [2023-12-25 10:26:01,191 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 714 transitions. Word has length 79 [2023-12-25 10:26:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 714 transitions. [2023-12-25 10:26:01,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 714 transitions. [2023-12-25 10:26:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:01,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:01,192 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] [2023-12-25 10:26:01,198 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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:01,396 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-25 10:26:01,396 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:01,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1154349460, now seen corresponding path program 1 times [2023-12-25 10:26:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789530414] [2023-12-25 10:26:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:01,397 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-25 10:26:01,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:01,398 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-25 10:26:01,399 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-25 10:26:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:01,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:01,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:01,954 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-25 10:26:01,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:01,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789530414] [2023-12-25 10:26:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789530414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916396157] [2023-12-25 10:26:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:01,956 INFO L87 Difference]: Start difference. First operand 542 states and 714 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:02,914 INFO L93 Difference]: Finished difference Result 818 states and 1124 transitions. [2023-12-25 10:26:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:02,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:02,916 INFO L225 Difference]: With dead ends: 818 [2023-12-25 10:26:02,916 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:02,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:02,917 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1311 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:02,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1083 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:26:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3536121673003803) internal successors, (712), 541 states have internal predecessors, (712), 0 states have call successors, (0), 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-25 10:26:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 712 transitions. [2023-12-25 10:26:02,925 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 712 transitions. Word has length 79 [2023-12-25 10:26:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:02,925 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 712 transitions. [2023-12-25 10:26:02,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 712 transitions. [2023-12-25 10:26:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:02,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:02,926 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] [2023-12-25 10:26:02,932 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-25 10:26:03,130 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-25 10:26:03,130 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:03,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1228420734, now seen corresponding path program 1 times [2023-12-25 10:26:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395029547] [2023-12-25 10:26:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:03,131 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-25 10:26:03,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:03,132 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-25 10:26:03,134 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-25 10:26:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:03,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:03,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:03,687 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-25 10:26:03,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:03,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395029547] [2023-12-25 10:26:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395029547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867045672] [2023-12-25 10:26:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:03,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:03,689 INFO L87 Difference]: Start difference. First operand 542 states and 712 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:04,767 INFO L93 Difference]: Finished difference Result 802 states and 1101 transitions. [2023-12-25 10:26:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:04,769 INFO L225 Difference]: With dead ends: 802 [2023-12-25 10:26:04,769 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:04,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:04,770 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1176 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:04,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1156 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.349809885931559) internal successors, (710), 541 states have internal predecessors, (710), 0 states have call successors, (0), 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-25 10:26:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 710 transitions. [2023-12-25 10:26:04,790 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 710 transitions. Word has length 79 [2023-12-25 10:26:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:04,790 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 710 transitions. [2023-12-25 10:26:04,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 710 transitions. [2023-12-25 10:26:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:04,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:04,792 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] [2023-12-25 10:26:04,800 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:04,995 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-25 10:26:04,996 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:04,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash -327266232, now seen corresponding path program 1 times [2023-12-25 10:26:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300485009] [2023-12-25 10:26:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:04,997 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-25 10:26:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:04,997 INFO L229 MonitoredProcess]: Starting monitored process 27 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-25 10:26:04,998 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 (27)] Waiting until timeout for monitored process [2023-12-25 10:26:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:05,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:05,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:05,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-25 10:26:05,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:05,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300485009] [2023-12-25 10:26:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300485009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:05,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:05,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113339047] [2023-12-25 10:26:05,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:05,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:05,566 INFO L87 Difference]: Start difference. First operand 542 states and 710 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:06,593 INFO L93 Difference]: Finished difference Result 858 states and 1171 transitions. [2023-12-25 10:26:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:06,595 INFO L225 Difference]: With dead ends: 858 [2023-12-25 10:26:06,595 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:06,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:06,596 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 1183 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1188 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 541 states have internal predecessors, (708), 0 states have call successors, (0), 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-25 10:26:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 708 transitions. [2023-12-25 10:26:06,605 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 708 transitions. Word has length 79 [2023-12-25 10:26:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:06,605 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 708 transitions. [2023-12-25 10:26:06,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 708 transitions. [2023-12-25 10:26:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:06,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:06,606 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] [2023-12-25 10:26:06,614 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 (27)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:06,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-25 10:26:06,810 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:06,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1076267745, now seen corresponding path program 1 times [2023-12-25 10:26:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277448541] [2023-12-25 10:26:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:06,811 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-25 10:26:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:06,812 INFO L229 MonitoredProcess]: Starting monitored process 28 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-25 10:26:06,813 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 (28)] Waiting until timeout for monitored process [2023-12-25 10:26:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:06,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:06,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:07,401 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-25 10:26:07,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:07,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277448541] [2023-12-25 10:26:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277448541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479078666] [2023-12-25 10:26:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:07,403 INFO L87 Difference]: Start difference. First operand 542 states and 708 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:08,478 INFO L93 Difference]: Finished difference Result 673 states and 902 transitions. [2023-12-25 10:26:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:08,480 INFO L225 Difference]: With dead ends: 673 [2023-12-25 10:26:08,480 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:08,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:08,481 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1170 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:08,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1157 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3422053231939164) internal successors, (706), 541 states have internal predecessors, (706), 0 states have call successors, (0), 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-25 10:26:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 706 transitions. [2023-12-25 10:26:08,488 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 706 transitions. Word has length 79 [2023-12-25 10:26:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 706 transitions. [2023-12-25 10:26:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 706 transitions. [2023-12-25 10:26:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:08,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:08,489 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] [2023-12-25 10:26:08,493 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 (28)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:08,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-25 10:26:08,692 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:08,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash 835929357, now seen corresponding path program 1 times [2023-12-25 10:26:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233969061] [2023-12-25 10:26:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:08,693 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-25 10:26:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:08,694 INFO L229 MonitoredProcess]: Starting monitored process 29 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-25 10:26:08,696 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 (29)] Waiting until timeout for monitored process [2023-12-25 10:26:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:08,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:08,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:09,315 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-25 10:26:09,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:09,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233969061] [2023-12-25 10:26:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233969061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38551915] [2023-12-25 10:26:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:09,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:09,317 INFO L87 Difference]: Start difference. First operand 542 states and 706 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:10,366 INFO L93 Difference]: Finished difference Result 685 states and 914 transitions. [2023-12-25 10:26:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:10,368 INFO L225 Difference]: With dead ends: 685 [2023-12-25 10:26:10,368 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:10,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:10,369 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1554 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:10,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1200 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.338403041825095) internal successors, (704), 541 states have internal predecessors, (704), 0 states have call successors, (0), 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-25 10:26:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 704 transitions. [2023-12-25 10:26:10,375 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 704 transitions. Word has length 79 [2023-12-25 10:26:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:10,375 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 704 transitions. [2023-12-25 10:26:10,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 704 transitions. [2023-12-25 10:26:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:10,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:10,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] [2023-12-25 10:26:10,384 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 (29)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-25 10:26:10,579 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:10,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:10,580 INFO L85 PathProgramCache]: Analyzing trace with hash -565396271, now seen corresponding path program 1 times [2023-12-25 10:26:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:10,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4298107] [2023-12-25 10:26:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:10,580 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-25 10:26:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:10,581 INFO L229 MonitoredProcess]: Starting monitored process 30 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-25 10:26:10,582 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 (30)] Waiting until timeout for monitored process [2023-12-25 10:26:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:10,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:10,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:11,126 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-25 10:26:11,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:11,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4298107] [2023-12-25 10:26:11,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4298107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:11,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:11,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929104682] [2023-12-25 10:26:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:11,127 INFO L87 Difference]: Start difference. First operand 542 states and 704 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:12,214 INFO L93 Difference]: Finished difference Result 798 states and 1088 transitions. [2023-12-25 10:26:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:12,215 INFO L225 Difference]: With dead ends: 798 [2023-12-25 10:26:12,216 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:12,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:12,216 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1571 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:12,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1160 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3346007604562737) internal successors, (702), 541 states have internal predecessors, (702), 0 states have call successors, (0), 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-25 10:26:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 702 transitions. [2023-12-25 10:26:12,222 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 702 transitions. Word has length 79 [2023-12-25 10:26:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:12,222 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 702 transitions. [2023-12-25 10:26:12,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 702 transitions. [2023-12-25 10:26:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 10:26:12,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:12,223 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] [2023-12-25 10:26:12,226 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:12,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-25 10:26:12,424 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:12,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1831404320, now seen corresponding path program 1 times [2023-12-25 10:26:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073607051] [2023-12-25 10:26:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:12,425 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-25 10:26:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:12,426 INFO L229 MonitoredProcess]: Starting monitored process 31 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-25 10:26:12,431 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 (31)] Waiting until timeout for monitored process [2023-12-25 10:26:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:12,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:12,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:12,957 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-25 10:26:12,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:12,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:12,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073607051] [2023-12-25 10:26:12,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073607051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:12,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138937886] [2023-12-25 10:26:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:12,959 INFO L87 Difference]: Start difference. First operand 542 states and 702 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:14,017 INFO L93 Difference]: Finished difference Result 673 states and 896 transitions. [2023-12-25 10:26:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 10:26:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:14,022 INFO L225 Difference]: With dead ends: 673 [2023-12-25 10:26:14,022 INFO L226 Difference]: Without dead ends: 668 [2023-12-25 10:26:14,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-25 10:26:14,023 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 1163 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:14,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1157 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:26:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-25 10:26:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2023-12-25 10:26:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3307984790874525) internal successors, (700), 541 states have internal predecessors, (700), 0 states have call successors, (0), 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-25 10:26:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 700 transitions. [2023-12-25 10:26:14,029 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 700 transitions. Word has length 79 [2023-12-25 10:26:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:14,030 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 700 transitions. [2023-12-25 10:26:14,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 10:26:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 700 transitions. [2023-12-25 10:26:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 10:26:14,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:14,031 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] [2023-12-25 10:26:14,034 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 (31)] Ended with exit code 0 [2023-12-25 10:26:14,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-25 10:26:14,234 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:14,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1961223322, now seen corresponding path program 1 times [2023-12-25 10:26:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66335856] [2023-12-25 10:26:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:14,235 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-25 10:26:14,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:14,236 INFO L229 MonitoredProcess]: Starting monitored process 32 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-25 10:26:14,237 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 (32)] Waiting until timeout for monitored process [2023-12-25 10:26:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:14,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:14,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:14,773 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-25 10:26:14,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:14,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66335856] [2023-12-25 10:26:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66335856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 10:26:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388896363] [2023-12-25 10:26:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:14,775 INFO L87 Difference]: Start difference. First operand 542 states and 700 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:15,139 INFO L93 Difference]: Finished difference Result 860 states and 1142 transitions. [2023-12-25 10:26:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:15,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2023-12-25 10:26:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:15,141 INFO L225 Difference]: With dead ends: 860 [2023-12-25 10:26:15,141 INFO L226 Difference]: Without dead ends: 617 [2023-12-25 10:26:15,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-25 10:26:15,141 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 1794 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:15,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 909 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:26:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-12-25 10:26:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 425. [2023-12-25 10:26:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 414 states have (on average 1.3357487922705313) internal successors, (553), 424 states have internal predecessors, (553), 0 states have call successors, (0), 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-25 10:26:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 553 transitions. [2023-12-25 10:26:15,148 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 553 transitions. Word has length 81 [2023-12-25 10:26:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:15,148 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 553 transitions. [2023-12-25 10:26:15,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 553 transitions. [2023-12-25 10:26:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 10:26:15,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:15,149 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] [2023-12-25 10:26:15,153 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 (32)] Ended with exit code 0 [2023-12-25 10:26:15,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-25 10:26:15,352 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:15,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1832785083, now seen corresponding path program 1 times [2023-12-25 10:26:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721816249] [2023-12-25 10:26:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:15,353 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-25 10:26:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:15,355 INFO L229 MonitoredProcess]: Starting monitored process 33 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-25 10:26:15,372 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 (33)] Waiting until timeout for monitored process [2023-12-25 10:26:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:15,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-25 10:26:15,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:18,957 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-25 10:26:18,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:18,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:18,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721816249] [2023-12-25 10:26:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721816249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:18,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:18,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-12-25 10:26:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028212639] [2023-12-25 10:26:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:18,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 10:26:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 10:26:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2023-12-25 10:26:18,959 INFO L87 Difference]: Start difference. First operand 425 states and 553 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:23,225 INFO L93 Difference]: Finished difference Result 593 states and 793 transitions. [2023-12-25 10:26:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 10:26:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2023-12-25 10:26:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:23,227 INFO L225 Difference]: With dead ends: 593 [2023-12-25 10:26:23,227 INFO L226 Difference]: Without dead ends: 434 [2023-12-25 10:26:23,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 10:26:23,228 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 371 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:23,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2848 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-25 10:26:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-12-25 10:26:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2023-12-25 10:26:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 420 states have (on average 1.3333333333333333) internal successors, (560), 430 states have internal predecessors, (560), 0 states have call successors, (0), 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-25 10:26:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 560 transitions. [2023-12-25 10:26:23,233 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 560 transitions. Word has length 81 [2023-12-25 10:26:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:23,233 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 560 transitions. [2023-12-25 10:26:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 560 transitions. [2023-12-25 10:26:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 10:26:23,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:23,234 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] [2023-12-25 10:26:23,243 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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:23,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-25 10:26:23,438 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:23,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1340490679, now seen corresponding path program 1 times [2023-12-25 10:26:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121739133] [2023-12-25 10:26:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:23,439 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-25 10:26:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:23,440 INFO L229 MonitoredProcess]: Starting monitored process 34 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-25 10:26:23,440 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 (34)] Waiting until timeout for monitored process [2023-12-25 10:26:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:23,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-25 10:26:23,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:28,064 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-25 10:26:28,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:28,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121739133] [2023-12-25 10:26:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121739133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-12-25 10:26:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564874996] [2023-12-25 10:26:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 10:26:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 10:26:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2023-12-25 10:26:28,066 INFO L87 Difference]: Start difference. First operand 431 states and 560 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:39,387 INFO L93 Difference]: Finished difference Result 585 states and 783 transitions. [2023-12-25 10:26:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 10:26:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2023-12-25 10:26:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:39,388 INFO L225 Difference]: With dead ends: 585 [2023-12-25 10:26:39,388 INFO L226 Difference]: Without dead ends: 443 [2023-12-25 10:26:39,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 10:26:39,389 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 479 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:39,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 3026 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-12-25 10:26:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-25 10:26:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 437. [2023-12-25 10:26:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 426 states have (on average 1.3333333333333333) internal successors, (568), 436 states have internal predecessors, (568), 0 states have call successors, (0), 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-25 10:26:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 568 transitions. [2023-12-25 10:26:39,395 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 568 transitions. Word has length 81 [2023-12-25 10:26:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:39,395 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 568 transitions. [2023-12-25 10:26:39,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 568 transitions. [2023-12-25 10:26:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 10:26:39,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:39,396 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] [2023-12-25 10:26:39,399 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 (34)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:39,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-25 10:26:39,599 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:39,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1064681092, now seen corresponding path program 1 times [2023-12-25 10:26:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:39,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437460431] [2023-12-25 10:26:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:39,600 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-25 10:26:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:39,601 INFO L229 MonitoredProcess]: Starting monitored process 35 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-25 10:26:39,602 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 (35)] Waiting until timeout for monitored process [2023-12-25 10:26:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:39,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:26:39,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:40,203 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-25 10:26:40,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:40,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437460431] [2023-12-25 10:26:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437460431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 10:26:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754696521] [2023-12-25 10:26:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:40,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 10:26:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 10:26:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 10:26:40,205 INFO L87 Difference]: Start difference. First operand 437 states and 568 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:40,529 INFO L93 Difference]: Finished difference Result 563 states and 758 transitions. [2023-12-25 10:26:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 10:26:40,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2023-12-25 10:26:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:40,530 INFO L225 Difference]: With dead ends: 563 [2023-12-25 10:26:40,530 INFO L226 Difference]: Without dead ends: 341 [2023-12-25 10:26:40,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-25 10:26:40,531 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 526 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:40,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1067 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 10:26:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-12-25 10:26:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-12-25 10:26:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 334 states have (on average 1.3383233532934131) internal successors, (447), 340 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:26:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 447 transitions. [2023-12-25 10:26:40,534 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 447 transitions. Word has length 81 [2023-12-25 10:26:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:40,534 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 447 transitions. [2023-12-25 10:26:40,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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-25 10:26:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2023-12-25 10:26:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 10:26:40,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:40,535 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] [2023-12-25 10:26:40,537 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 (35)] Ended with exit code 0 [2023-12-25 10:26:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-25 10:26:40,735 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:40,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1087776533, now seen corresponding path program 1 times [2023-12-25 10:26:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764024661] [2023-12-25 10:26:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:40,736 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-25 10:26:40,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:40,737 INFO L229 MonitoredProcess]: Starting monitored process 36 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-25 10:26:40,738 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 (36)] Waiting until timeout for monitored process [2023-12-25 10:26:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:40,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:26:40,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:41,335 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-25 10:26:41,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:41,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764024661] [2023-12-25 10:26:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764024661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 10:26:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804825052] [2023-12-25 10:26:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 10:26:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 10:26:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 10:26:41,336 INFO L87 Difference]: Start difference. First operand 341 states and 447 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:41,748 INFO L93 Difference]: Finished difference Result 665 states and 918 transitions. [2023-12-25 10:26:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 10:26:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-12-25 10:26:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:41,750 INFO L225 Difference]: With dead ends: 665 [2023-12-25 10:26:41,750 INFO L226 Difference]: Without dead ends: 485 [2023-12-25 10:26:41,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-25 10:26:41,750 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 709 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:41,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1402 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:26:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-25 10:26:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 286. [2023-12-25 10:26:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 282 states have (on average 1.3297872340425532) internal successors, (375), 285 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:26:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 375 transitions. [2023-12-25 10:26:41,753 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 375 transitions. Word has length 82 [2023-12-25 10:26:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:41,754 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 375 transitions. [2023-12-25 10:26:41,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 375 transitions. [2023-12-25 10:26:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 10:26:41,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:41,754 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] [2023-12-25 10:26:41,757 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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-25 10:26:41,955 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:41,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1580070937, now seen corresponding path program 1 times [2023-12-25 10:26:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111453053] [2023-12-25 10:26:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:41,956 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-25 10:26:41,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:41,957 INFO L229 MonitoredProcess]: Starting monitored process 37 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-25 10:26:41,958 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 (37)] Waiting until timeout for monitored process [2023-12-25 10:26:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:42,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 10:26:42,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:43,196 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-25 10:26:43,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:43,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111453053] [2023-12-25 10:26:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111453053] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:43,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:43,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 10:26:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66563324] [2023-12-25 10:26:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:43,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 10:26:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 10:26:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 10:26:43,197 INFO L87 Difference]: Start difference. First operand 286 states and 375 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:44,156 INFO L93 Difference]: Finished difference Result 740 states and 1037 transitions. [2023-12-25 10:26:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 10:26:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-12-25 10:26:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:44,158 INFO L225 Difference]: With dead ends: 740 [2023-12-25 10:26:44,158 INFO L226 Difference]: Without dead ends: 592 [2023-12-25 10:26:44,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2023-12-25 10:26:44,159 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 1060 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:44,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 1864 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:26:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-12-25 10:26:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 253. [2023-12-25 10:26:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 251 states have (on average 1.3187250996015936) internal successors, (331), 252 states have internal predecessors, (331), 0 states have call successors, (0), 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-25 10:26:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2023-12-25 10:26:44,163 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 82 [2023-12-25 10:26:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:44,163 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2023-12-25 10:26:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2023-12-25 10:26:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 10:26:44,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:44,164 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] [2023-12-25 10:26:44,166 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 (37)] Ended with exit code 0 [2023-12-25 10:26:44,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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-25 10:26:44,364 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:44,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -748534451, now seen corresponding path program 1 times [2023-12-25 10:26:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567824150] [2023-12-25 10:26:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:44,365 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-25 10:26:44,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:44,366 INFO L229 MonitoredProcess]: Starting monitored process 38 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-25 10:26:44,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 10:26:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:44,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:26:44,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:26:44,933 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-25 10:26:44,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:26:44,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:26:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567824150] [2023-12-25 10:26:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567824150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:26:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:26:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:26:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117477616] [2023-12-25 10:26:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:26:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:26:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:26:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:26:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:26:44,934 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:26:45,351 INFO L93 Difference]: Finished difference Result 409 states and 556 transitions. [2023-12-25 10:26:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:26:45,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-12-25 10:26:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:26:45,352 INFO L225 Difference]: With dead ends: 409 [2023-12-25 10:26:45,352 INFO L226 Difference]: Without dead ends: 253 [2023-12-25 10:26:45,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 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-25 10:26:45,353 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 530 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:26:45,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 343 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:26:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-25 10:26:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-12-25 10:26:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 252 states have internal predecessors, (329), 0 states have call successors, (0), 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-25 10:26:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2023-12-25 10:26:45,355 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 82 [2023-12-25 10:26:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:26:45,356 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2023-12-25 10:26:45,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-25 10:26:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2023-12-25 10:26:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 10:26:45,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:26:45,356 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] [2023-12-25 10:26:45,360 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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 10:26:45,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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-25 10:26:45,559 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:26:45,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:26:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash -633529937, now seen corresponding path program 1 times [2023-12-25 10:26:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:26:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872114248] [2023-12-25 10:26:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:26:45,560 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-25 10:26:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:26:45,561 INFO L229 MonitoredProcess]: Starting monitored process 39 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-25 10:26:45,562 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 (39)] Waiting until timeout for monitored process [2023-12-25 10:26:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:26:45,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-25 10:26:45,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:00,482 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-25 10:27:00,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:00,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872114248] [2023-12-25 10:27:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872114248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:00,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2023-12-25 10:27:00,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390731071] [2023-12-25 10:27:00,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:00,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 10:27:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:00,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 10:27:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2023-12-25 10:27:00,484 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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-25 10:27:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:37,755 INFO L93 Difference]: Finished difference Result 549 states and 757 transitions. [2023-12-25 10:27:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 10:27:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2023-12-25 10:27:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:37,757 INFO L225 Difference]: With dead ends: 549 [2023-12-25 10:27:37,757 INFO L226 Difference]: Without dead ends: 410 [2023-12-25 10:27:37,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=329, Invalid=1651, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 10:27:37,759 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 534 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:37,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 2128 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 30.1s Time] [2023-12-25 10:27:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-12-25 10:27:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2023-12-25 10:27:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.303370786516854) internal successors, (348), 268 states have internal predecessors, (348), 0 states have call successors, (0), 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-25 10:27:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2023-12-25 10:27:37,763 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 84 [2023-12-25 10:27:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:37,763 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2023-12-25 10:27:37,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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-25 10:27:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2023-12-25 10:27:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 10:27:37,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:37,764 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] [2023-12-25 10:27:37,772 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 (39)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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-25 10:27:37,968 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:37,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 362850175, now seen corresponding path program 1 times [2023-12-25 10:27:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203025736] [2023-12-25 10:27:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:37,969 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-25 10:27:37,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:37,970 INFO L229 MonitoredProcess]: Starting monitored process 40 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-25 10:27:37,971 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 (40)] Waiting until timeout for monitored process [2023-12-25 10:27:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:38,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:27:38,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:38,631 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-25 10:27:38,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:38,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203025736] [2023-12-25 10:27:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203025736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 10:27:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936249542] [2023-12-25 10:27:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 10:27:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 10:27:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 10:27:38,633 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 10:27:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:39,031 INFO L93 Difference]: Finished difference Result 421 states and 570 transitions. [2023-12-25 10:27:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 10:27:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2023-12-25 10:27:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:39,033 INFO L225 Difference]: With dead ends: 421 [2023-12-25 10:27:39,033 INFO L226 Difference]: Without dead ends: 415 [2023-12-25 10:27:39,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-25 10:27:39,033 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 738 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:39,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1006 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:27:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-25 10:27:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 262. [2023-12-25 10:27:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 0 states have call successors, (0), 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-25 10:27:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2023-12-25 10:27:39,037 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 85 [2023-12-25 10:27:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2023-12-25 10:27:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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-25 10:27:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2023-12-25 10:27:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 10:27:39,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:39,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:39,041 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 (40)] Ended with exit code 0 [2023-12-25 10:27:39,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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-25 10:27:39,240 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:39,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1137760319, now seen corresponding path program 1 times [2023-12-25 10:27:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:39,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90297356] [2023-12-25 10:27:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:39,241 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-25 10:27:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:39,242 INFO L229 MonitoredProcess]: Starting monitored process 41 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-25 10:27:39,243 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 (41)] Waiting until timeout for monitored process [2023-12-25 10:27:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:39,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:27:39,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:39,797 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-25 10:27:39,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:39,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90297356] [2023-12-25 10:27:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90297356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:27:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266294422] [2023-12-25 10:27:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:27:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:27:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:27:39,799 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 10:27:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:40,207 INFO L93 Difference]: Finished difference Result 400 states and 542 transitions. [2023-12-25 10:27:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 10:27:40,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2023-12-25 10:27:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:40,209 INFO L225 Difference]: With dead ends: 400 [2023-12-25 10:27:40,209 INFO L226 Difference]: Without dead ends: 262 [2023-12-25 10:27:40,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 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-25 10:27:40,209 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 497 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:40,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 337 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:27:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-25 10:27:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2023-12-25 10:27:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.2911877394636015) internal successors, (337), 261 states have internal predecessors, (337), 0 states have call successors, (0), 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-25 10:27:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 337 transitions. [2023-12-25 10:27:40,213 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 337 transitions. Word has length 111 [2023-12-25 10:27:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:40,213 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 337 transitions. [2023-12-25 10:27:40,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 10:27:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 337 transitions. [2023-12-25 10:27:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 10:27:40,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:40,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:40,217 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 (41)] Ended with exit code 0 [2023-12-25 10:27:40,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /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-25 10:27:40,416 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:40,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash -793401698, now seen corresponding path program 1 times [2023-12-25 10:27:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831200279] [2023-12-25 10:27:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:40,417 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-25 10:27:40,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:40,418 INFO L229 MonitoredProcess]: Starting monitored process 42 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-25 10:27:40,419 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 (42)] Waiting until timeout for monitored process [2023-12-25 10:27:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:40,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 10:27:40,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:41,073 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-25 10:27:41,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:41,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:41,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831200279] [2023-12-25 10:27:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831200279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:41,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:27:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812506538] [2023-12-25 10:27:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:41,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:27:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:27:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:27:41,075 INFO L87 Difference]: Start difference. First operand 262 states and 337 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-25 10:27:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:41,484 INFO L93 Difference]: Finished difference Result 514 states and 717 transitions. [2023-12-25 10:27:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 10:27:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2023-12-25 10:27:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:41,485 INFO L225 Difference]: With dead ends: 514 [2023-12-25 10:27:41,485 INFO L226 Difference]: Without dead ends: 388 [2023-12-25 10:27:41,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-25 10:27:41,486 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 1058 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:41,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 352 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 10:27:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-25 10:27:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 236. [2023-12-25 10:27:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 235 states have internal predecessors, (308), 0 states have call successors, (0), 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-25 10:27:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 308 transitions. [2023-12-25 10:27:41,489 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 308 transitions. Word has length 114 [2023-12-25 10:27:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 308 transitions. [2023-12-25 10:27:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-25 10:27:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 308 transitions. [2023-12-25 10:27:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 10:27:41,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:41,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:41,492 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 (42)] Ended with exit code 0 [2023-12-25 10:27:41,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /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-25 10:27:41,690 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:41,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1556265405, now seen corresponding path program 1 times [2023-12-25 10:27:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:41,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701883665] [2023-12-25 10:27:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:41,691 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-25 10:27:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:41,692 INFO L229 MonitoredProcess]: Starting monitored process 43 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-25 10:27:41,693 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 (43)] Waiting until timeout for monitored process [2023-12-25 10:27:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:41,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:41,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:41,878 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-25 10:27:41,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:41,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:41,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701883665] [2023-12-25 10:27:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701883665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:41,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:41,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713001626] [2023-12-25 10:27:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:41,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:41,879 INFO L87 Difference]: Start difference. First operand 236 states and 308 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-25 10:27:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:41,899 INFO L93 Difference]: Finished difference Result 472 states and 664 transitions. [2023-12-25 10:27:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2023-12-25 10:27:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:41,900 INFO L225 Difference]: With dead ends: 472 [2023-12-25 10:27:41,900 INFO L226 Difference]: Without dead ends: 346 [2023-12-25 10:27:41,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:41,901 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 115 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 374 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-25 10:27:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2023-12-25 10:27:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.3731778425655976) internal successors, (471), 343 states have internal predecessors, (471), 0 states have call successors, (0), 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-25 10:27:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 471 transitions. [2023-12-25 10:27:41,905 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 471 transitions. Word has length 114 [2023-12-25 10:27:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:41,905 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 471 transitions. [2023-12-25 10:27:41,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-25 10:27:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 471 transitions. [2023-12-25 10:27:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 10:27:41,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:41,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:41,909 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 (43)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:42,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /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-25 10:27:42,109 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:42,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1770294381, now seen corresponding path program 1 times [2023-12-25 10:27:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753535802] [2023-12-25 10:27:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:42,110 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-25 10:27:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:42,111 INFO L229 MonitoredProcess]: Starting monitored process 44 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-25 10:27:42,111 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 (44)] Waiting until timeout for monitored process [2023-12-25 10:27:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:42,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:42,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:42,303 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-25 10:27:42,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:42,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753535802] [2023-12-25 10:27:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753535802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496988258] [2023-12-25 10:27:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:42,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:42,304 INFO L87 Difference]: Start difference. First operand 344 states and 471 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:42,324 INFO L93 Difference]: Finished difference Result 780 states and 1129 transitions. [2023-12-25 10:27:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 10:27:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:42,326 INFO L225 Difference]: With dead ends: 780 [2023-12-25 10:27:42,326 INFO L226 Difference]: Without dead ends: 546 [2023-12-25 10:27:42,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:42,326 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:42,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 375 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-12-25 10:27:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2023-12-25 10:27:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.419889502762431) internal successors, (771), 543 states have internal predecessors, (771), 0 states have call successors, (0), 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-25 10:27:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 771 transitions. [2023-12-25 10:27:42,332 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 771 transitions. Word has length 115 [2023-12-25 10:27:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:42,332 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 771 transitions. [2023-12-25 10:27:42,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 771 transitions. [2023-12-25 10:27:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 10:27:42,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:42,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:42,336 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 (44)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /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-25 10:27:42,536 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:42,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -602502088, now seen corresponding path program 1 times [2023-12-25 10:27:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304785474] [2023-12-25 10:27:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:42,537 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-25 10:27:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:42,538 INFO L229 MonitoredProcess]: Starting monitored process 45 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-25 10:27:42,539 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 (45)] Waiting until timeout for monitored process [2023-12-25 10:27:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:42,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:42,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:42,733 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-25 10:27:42,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:42,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304785474] [2023-12-25 10:27:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304785474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945833816] [2023-12-25 10:27:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:42,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:42,735 INFO L87 Difference]: Start difference. First operand 544 states and 771 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:42,752 INFO L93 Difference]: Finished difference Result 1348 states and 1981 transitions. [2023-12-25 10:27:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2023-12-25 10:27:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:42,755 INFO L225 Difference]: With dead ends: 1348 [2023-12-25 10:27:42,755 INFO L226 Difference]: Without dead ends: 914 [2023-12-25 10:27:42,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:42,756 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 99 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:42,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 376 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-12-25 10:27:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2023-12-25 10:27:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.4478594950603731) internal successors, (1319), 911 states have internal predecessors, (1319), 0 states have call successors, (0), 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-25 10:27:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1319 transitions. [2023-12-25 10:27:42,764 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1319 transitions. Word has length 116 [2023-12-25 10:27:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:42,764 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1319 transitions. [2023-12-25 10:27:42,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1319 transitions. [2023-12-25 10:27:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 10:27:42,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:42,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:42,768 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 (45)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:42,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /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-25 10:27:42,966 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:42,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash 518819124, now seen corresponding path program 1 times [2023-12-25 10:27:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451064858] [2023-12-25 10:27:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:42,966 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-25 10:27:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:42,967 INFO L229 MonitoredProcess]: Starting monitored process 46 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-25 10:27:42,968 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 (46)] Waiting until timeout for monitored process [2023-12-25 10:27:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:43,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:43,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:43,171 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-25 10:27:43,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:43,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451064858] [2023-12-25 10:27:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451064858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124661714] [2023-12-25 10:27:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:43,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:43,173 INFO L87 Difference]: Start difference. First operand 912 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:43,194 INFO L93 Difference]: Finished difference Result 2388 states and 3529 transitions. [2023-12-25 10:27:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2023-12-25 10:27:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:43,200 INFO L225 Difference]: With dead ends: 2388 [2023-12-25 10:27:43,200 INFO L226 Difference]: Without dead ends: 1586 [2023-12-25 10:27:43,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:43,201 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 91 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:43,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 377 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2023-12-25 10:27:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1584. [2023-12-25 10:27:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.459886291850916) internal successors, (2311), 1583 states have internal predecessors, (2311), 0 states have call successors, (0), 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-25 10:27:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2311 transitions. [2023-12-25 10:27:43,216 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2311 transitions. Word has length 117 [2023-12-25 10:27:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:43,216 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2311 transitions. [2023-12-25 10:27:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2311 transitions. [2023-12-25 10:27:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-25 10:27:43,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:43,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:43,224 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 (46)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:43,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /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-25 10:27:43,421 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:43,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1913038277, now seen corresponding path program 1 times [2023-12-25 10:27:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359104995] [2023-12-25 10:27:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:43,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-25 10:27:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:43,422 INFO L229 MonitoredProcess]: Starting monitored process 47 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-25 10:27:43,423 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 (47)] Waiting until timeout for monitored process [2023-12-25 10:27:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:43,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:27:43,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:44,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:44,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359104995] [2023-12-25 10:27:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359104995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:27:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345374243] [2023-12-25 10:27:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:44,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:27:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:27:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:27:44,698 INFO L87 Difference]: Start difference. First operand 1584 states and 2311 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:44,847 INFO L93 Difference]: Finished difference Result 10428 states and 15469 transitions. [2023-12-25 10:27:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:27:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2023-12-25 10:27:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:44,860 INFO L225 Difference]: With dead ends: 10428 [2023-12-25 10:27:44,860 INFO L226 Difference]: Without dead ends: 8954 [2023-12-25 10:27:44,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:27:44,864 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 601 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:44,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 912 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:27:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8954 states. [2023-12-25 10:27:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8954 to 4528. [2023-12-25 10:27:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4528 states, 4527 states have (on average 1.4576982549149546) internal successors, (6599), 4527 states have internal predecessors, (6599), 0 states have call successors, (0), 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-25 10:27:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 6599 transitions. [2023-12-25 10:27:44,914 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 6599 transitions. Word has length 118 [2023-12-25 10:27:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:44,914 INFO L495 AbstractCegarLoop]: Abstraction has 4528 states and 6599 transitions. [2023-12-25 10:27:44,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 6599 transitions. [2023-12-25 10:27:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 10:27:44,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:44,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:44,917 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 (47)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:45,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /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-25 10:27:45,115 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:45,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -989686714, now seen corresponding path program 1 times [2023-12-25 10:27:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149266866] [2023-12-25 10:27:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:45,116 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-25 10:27:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:45,117 INFO L229 MonitoredProcess]: Starting monitored process 48 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-25 10:27:45,118 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 (48)] Waiting until timeout for monitored process [2023-12-25 10:27:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:45,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 10:27:45,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:45,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:45,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149266866] [2023-12-25 10:27:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149266866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 10:27:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421867712] [2023-12-25 10:27:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:45,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 10:27:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 10:27:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 10:27:45,447 INFO L87 Difference]: Start difference. First operand 4528 states and 6599 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:45,506 INFO L93 Difference]: Finished difference Result 10900 states and 15849 transitions. [2023-12-25 10:27:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 10:27:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2023-12-25 10:27:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:45,516 INFO L225 Difference]: With dead ends: 10900 [2023-12-25 10:27:45,517 INFO L226 Difference]: Without dead ends: 6482 [2023-12-25 10:27:45,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 10:27:45,522 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:45,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 451 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2023-12-25 10:27:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6432. [2023-12-25 10:27:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6432 states, 6431 states have (on average 1.4291712019903593) internal successors, (9191), 6431 states have internal predecessors, (9191), 0 states have call successors, (0), 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-25 10:27:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9191 transitions. [2023-12-25 10:27:45,592 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9191 transitions. Word has length 120 [2023-12-25 10:27:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:45,593 INFO L495 AbstractCegarLoop]: Abstraction has 6432 states and 9191 transitions. [2023-12-25 10:27:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9191 transitions. [2023-12-25 10:27:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 10:27:45,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:45,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:45,599 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 (48)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:45,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /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-25 10:27:45,797 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:45,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash 782428924, now seen corresponding path program 1 times [2023-12-25 10:27:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237290460] [2023-12-25 10:27:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:45,798 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-25 10:27:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:45,799 INFO L229 MonitoredProcess]: Starting monitored process 49 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-25 10:27:45,800 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 (49)] Waiting until timeout for monitored process [2023-12-25 10:27:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:45,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:27:45,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:46,003 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-25 10:27:46,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:46,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:46,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237290460] [2023-12-25 10:27:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237290460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:46,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:46,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 10:27:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308647119] [2023-12-25 10:27:46,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:46,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 10:27:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 10:27:46,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 10:27:46,006 INFO L87 Difference]: Start difference. First operand 6432 states and 9191 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:46,116 INFO L93 Difference]: Finished difference Result 12194 states and 17302 transitions. [2023-12-25 10:27:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 10:27:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2023-12-25 10:27:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:46,135 INFO L225 Difference]: With dead ends: 12194 [2023-12-25 10:27:46,135 INFO L226 Difference]: Without dead ends: 12192 [2023-12-25 10:27:46,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:27:46,140 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 312 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:46,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 766 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:27:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12192 states. [2023-12-25 10:27:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12192 to 6768. [2023-12-25 10:27:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6768 states, 6767 states have (on average 1.4054972661445249) internal successors, (9511), 6767 states have internal predecessors, (9511), 0 states have call successors, (0), 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-25 10:27:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 9511 transitions. [2023-12-25 10:27:46,246 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 9511 transitions. Word has length 121 [2023-12-25 10:27:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:46,246 INFO L495 AbstractCegarLoop]: Abstraction has 6768 states and 9511 transitions. [2023-12-25 10:27:46,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 9511 transitions. [2023-12-25 10:27:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 10:27:46,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:46,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:46,253 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 (49)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:46,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /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-25 10:27:46,451 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:46,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1123140857, now seen corresponding path program 1 times [2023-12-25 10:27:46,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942305373] [2023-12-25 10:27:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:46,452 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-25 10:27:46,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:46,453 INFO L229 MonitoredProcess]: Starting monitored process 50 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-25 10:27:46,453 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 (50)] Waiting until timeout for monitored process [2023-12-25 10:27:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:46,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:46,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:46,677 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-25 10:27:46,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:46,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942305373] [2023-12-25 10:27:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942305373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467957621] [2023-12-25 10:27:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:46,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:46,679 INFO L87 Difference]: Start difference. First operand 6768 states and 9511 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:46,731 INFO L93 Difference]: Finished difference Result 15223 states and 21565 transitions. [2023-12-25 10:27:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:46,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2023-12-25 10:27:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:46,748 INFO L225 Difference]: With dead ends: 15223 [2023-12-25 10:27:46,748 INFO L226 Difference]: Without dead ends: 10516 [2023-12-25 10:27:46,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:46,798 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 120 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:46,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 375 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10516 states. [2023-12-25 10:27:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10516 to 10514. [2023-12-25 10:27:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10514 states, 10513 states have (on average 1.3979834490630647) internal successors, (14697), 10513 states have internal predecessors, (14697), 0 states have call successors, (0), 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-25 10:27:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 14697 transitions. [2023-12-25 10:27:46,898 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 14697 transitions. Word has length 121 [2023-12-25 10:27:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:46,898 INFO L495 AbstractCegarLoop]: Abstraction has 10514 states and 14697 transitions. [2023-12-25 10:27:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:27:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 14697 transitions. [2023-12-25 10:27:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-25 10:27:46,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:46,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:46,908 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 (50)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:47,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /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-25 10:27:47,106 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:47,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2012808946, now seen corresponding path program 1 times [2023-12-25 10:27:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424545620] [2023-12-25 10:27:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:47,107 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-25 10:27:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:47,108 INFO L229 MonitoredProcess]: Starting monitored process 51 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-25 10:27:47,108 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 (51)] Waiting until timeout for monitored process [2023-12-25 10:27:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:47,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:27:47,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:47,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:27:47,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:47,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424545620] [2023-12-25 10:27:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424545620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:27:47,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:27:47,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:27:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781235850] [2023-12-25 10:27:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:27:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:27:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:27:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:47,333 INFO L87 Difference]: Start difference. First operand 10514 states and 14697 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-25 10:27:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:47,381 INFO L93 Difference]: Finished difference Result 19006 states and 26697 transitions. [2023-12-25 10:27:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:27:47,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2023-12-25 10:27:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:47,393 INFO L225 Difference]: With dead ends: 19006 [2023-12-25 10:27:47,394 INFO L226 Difference]: Without dead ends: 8604 [2023-12-25 10:27:47,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:27:47,403 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:47,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 378 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:27:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8604 states. [2023-12-25 10:27:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8604 to 8602. [2023-12-25 10:27:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8602 states, 8601 states have (on average 1.3977444483199628) internal successors, (12022), 8601 states have internal predecessors, (12022), 0 states have call successors, (0), 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-25 10:27:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8602 states to 8602 states and 12022 transitions. [2023-12-25 10:27:47,500 INFO L78 Accepts]: Start accepts. Automaton has 8602 states and 12022 transitions. Word has length 150 [2023-12-25 10:27:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:47,500 INFO L495 AbstractCegarLoop]: Abstraction has 8602 states and 12022 transitions. [2023-12-25 10:27:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-25 10:27:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8602 states and 12022 transitions. [2023-12-25 10:27:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 10:27:47,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:47,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:47,507 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 (51)] Ended with exit code 0 [2023-12-25 10:27:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /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-25 10:27:47,706 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:47,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1519258207, now seen corresponding path program 1 times [2023-12-25 10:27:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969237920] [2023-12-25 10:27:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:47,707 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-25 10:27:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:47,708 INFO L229 MonitoredProcess]: Starting monitored process 52 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-25 10:27:47,714 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 (52)] Waiting until timeout for monitored process [2023-12-25 10:27:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:47,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 10:27:47,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:48,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:27:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:49,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969237920] [2023-12-25 10:27:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969237920] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:27:49,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:27:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-25 10:27:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113570449] [2023-12-25 10:27:49,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:27:49,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 10:27:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 10:27:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-12-25 10:27:49,324 INFO L87 Difference]: Start difference. First operand 8602 states and 12022 transitions. Second operand has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 21 states have internal predecessors, (282), 0 states have call successors, (0), 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-25 10:27:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:27:54,599 INFO L93 Difference]: Finished difference Result 47027 states and 65181 transitions. [2023-12-25 10:27:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 10:27:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 21 states have internal predecessors, (282), 0 states have call successors, (0), 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 151 [2023-12-25 10:27:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:27:54,646 INFO L225 Difference]: With dead ends: 47027 [2023-12-25 10:27:54,646 INFO L226 Difference]: Without dead ends: 38577 [2023-12-25 10:27:54,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1336, Invalid=4516, Unknown=0, NotChecked=0, Total=5852 [2023-12-25 10:27:54,663 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6906 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6906 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:27:54,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6906 Valid, 2102 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-25 10:27:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38577 states. [2023-12-25 10:27:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38577 to 8746. [2023-12-25 10:27:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8746 states, 8745 states have (on average 1.391194968553459) internal successors, (12166), 8745 states have internal predecessors, (12166), 0 states have call successors, (0), 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-25 10:27:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8746 states to 8746 states and 12166 transitions. [2023-12-25 10:27:54,943 INFO L78 Accepts]: Start accepts. Automaton has 8746 states and 12166 transitions. Word has length 151 [2023-12-25 10:27:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:27:54,944 INFO L495 AbstractCegarLoop]: Abstraction has 8746 states and 12166 transitions. [2023-12-25 10:27:54,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 21 states have internal predecessors, (282), 0 states have call successors, (0), 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-25 10:27:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8746 states and 12166 transitions. [2023-12-25 10:27:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 10:27:54,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:27:54,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:27:54,954 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 (52)] Forceful destruction successful, exit code 0 [2023-12-25 10:27:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /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-25 10:27:55,151 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:27:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:27:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -985318425, now seen corresponding path program 1 times [2023-12-25 10:27:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:27:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119254034] [2023-12-25 10:27:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:27:55,152 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-25 10:27:55,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:27:55,153 INFO L229 MonitoredProcess]: Starting monitored process 53 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-25 10:27:55,154 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 (53)] Waiting until timeout for monitored process [2023-12-25 10:27:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:27:55,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:27:55,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:27:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:56,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:27:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:27:56,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:27:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119254034] [2023-12-25 10:27:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119254034] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:27:56,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:27:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:27:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848509995] [2023-12-25 10:27:56,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:27:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:27:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:27:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:27:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:27:56,673 INFO L87 Difference]: Start difference. First operand 8746 states and 12166 transitions. Second operand has 24 states, 24 states have (on average 11.5) internal successors, (276), 23 states have internal predecessors, (276), 0 states have call successors, (0), 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-25 10:28:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:03,514 INFO L93 Difference]: Finished difference Result 53175 states and 72866 transitions. [2023-12-25 10:28:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-25 10:28:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.5) internal successors, (276), 23 states have internal predecessors, (276), 0 states have call successors, (0), 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 151 [2023-12-25 10:28:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:03,557 INFO L225 Difference]: With dead ends: 53175 [2023-12-25 10:28:03,557 INFO L226 Difference]: Without dead ends: 44581 [2023-12-25 10:28:03,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1992, Invalid=8310, Unknown=0, NotChecked=0, Total=10302 [2023-12-25 10:28:03,574 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 4228 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4228 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:03,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4228 Valid, 2344 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-25 10:28:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44581 states. [2023-12-25 10:28:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44581 to 8746. [2023-12-25 10:28:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8746 states, 8745 states have (on average 1.3857061177815895) internal successors, (12118), 8745 states have internal predecessors, (12118), 0 states have call successors, (0), 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-25 10:28:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8746 states to 8746 states and 12118 transitions. [2023-12-25 10:28:03,813 INFO L78 Accepts]: Start accepts. Automaton has 8746 states and 12118 transitions. Word has length 151 [2023-12-25 10:28:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:03,814 INFO L495 AbstractCegarLoop]: Abstraction has 8746 states and 12118 transitions. [2023-12-25 10:28:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.5) internal successors, (276), 23 states have internal predecessors, (276), 0 states have call successors, (0), 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-25 10:28:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8746 states and 12118 transitions. [2023-12-25 10:28:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:28:03,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:03,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:03,822 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 (53)] Forceful destruction successful, exit code 0 [2023-12-25 10:28:04,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /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-25 10:28:04,020 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:04,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -63266792, now seen corresponding path program 1 times [2023-12-25 10:28:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408274208] [2023-12-25 10:28:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:04,021 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-25 10:28:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:04,022 INFO L229 MonitoredProcess]: Starting monitored process 54 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-25 10:28:04,023 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 (54)] Waiting until timeout for monitored process [2023-12-25 10:28:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:04,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:28:04,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:05,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:28:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:05,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408274208] [2023-12-25 10:28:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408274208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:28:05,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:28:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:28:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217319603] [2023-12-25 10:28:05,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:28:05,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:28:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:05,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:28:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:28:05,793 INFO L87 Difference]: Start difference. First operand 8746 states and 12118 transitions. Second operand has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:28:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:28,833 INFO L93 Difference]: Finished difference Result 84731 states and 115682 transitions. [2023-12-25 10:28:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2023-12-25 10:28:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2023-12-25 10:28:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:28,910 INFO L225 Difference]: With dead ends: 84731 [2023-12-25 10:28:28,910 INFO L226 Difference]: Without dead ends: 76137 [2023-12-25 10:28:28,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44685 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=14282, Invalid=89080, Unknown=0, NotChecked=0, Total=103362 [2023-12-25 10:28:28,940 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 16115 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16115 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:28,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16115 Valid, 2798 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-25 10:28:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76137 states. [2023-12-25 10:28:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76137 to 9082. [2023-12-25 10:28:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9082 states, 9081 states have (on average 1.3767206254817752) internal successors, (12502), 9081 states have internal predecessors, (12502), 0 states have call successors, (0), 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-25 10:28:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 12502 transitions. [2023-12-25 10:28:29,387 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 12502 transitions. Word has length 152 [2023-12-25 10:28:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:29,387 INFO L495 AbstractCegarLoop]: Abstraction has 9082 states and 12502 transitions. [2023-12-25 10:28:29,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.0) internal successors, (288), 23 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:28:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 12502 transitions. [2023-12-25 10:28:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:28:29,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:29,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:29,396 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 (54)] Forceful destruction successful, exit code 0 [2023-12-25 10:28:29,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /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-25 10:28:29,593 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:29,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -141167818, now seen corresponding path program 1 times [2023-12-25 10:28:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097321362] [2023-12-25 10:28:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:29,595 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-25 10:28:29,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:29,596 INFO L229 MonitoredProcess]: Starting monitored process 55 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-25 10:28:29,596 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 (55)] Waiting until timeout for monitored process [2023-12-25 10:28:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:29,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:28:29,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:29,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:29,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097321362] [2023-12-25 10:28:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097321362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:28:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349866505] [2023-12-25 10:28:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:28:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:28:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:29,820 INFO L87 Difference]: Start difference. First operand 9082 states and 12502 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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-25 10:28:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:29,861 INFO L93 Difference]: Finished difference Result 13478 states and 18576 transitions. [2023-12-25 10:28:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:28:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2023-12-25 10:28:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:29,865 INFO L225 Difference]: With dead ends: 13478 [2023-12-25 10:28:29,865 INFO L226 Difference]: Without dead ends: 4548 [2023-12-25 10:28:29,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:29,871 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 78 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:29,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 357 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:28:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2023-12-25 10:28:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 4546. [2023-12-25 10:28:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4546 states, 4545 states have (on average 1.3513751375137513) internal successors, (6142), 4545 states have internal predecessors, (6142), 0 states have call successors, (0), 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-25 10:28:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 6142 transitions. [2023-12-25 10:28:29,899 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 6142 transitions. Word has length 153 [2023-12-25 10:28:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:29,899 INFO L495 AbstractCegarLoop]: Abstraction has 4546 states and 6142 transitions. [2023-12-25 10:28:29,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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-25 10:28:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 6142 transitions. [2023-12-25 10:28:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:28:29,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:29,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:29,904 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 (55)] Ended with exit code 0 [2023-12-25 10:28:30,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /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-25 10:28:30,101 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:30,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1473360138, now seen corresponding path program 1 times [2023-12-25 10:28:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235939507] [2023-12-25 10:28:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:30,102 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-25 10:28:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:30,103 INFO L229 MonitoredProcess]: Starting monitored process 56 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-25 10:28:30,104 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 (56)] Waiting until timeout for monitored process [2023-12-25 10:28:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:30,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:28:30,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:31,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:28:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:31,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235939507] [2023-12-25 10:28:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235939507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:28:31,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:28:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:28:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087177056] [2023-12-25 10:28:31,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:28:31,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:28:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:28:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:28:31,704 INFO L87 Difference]: Start difference. First operand 4546 states and 6142 transitions. Second operand has 24 states, 24 states have (on average 12.25) internal successors, (294), 23 states have internal predecessors, (294), 0 states have call successors, (0), 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-25 10:28:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:41,033 INFO L93 Difference]: Finished difference Result 31221 states and 41778 transitions. [2023-12-25 10:28:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 10:28:41,034 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 12.25) internal successors, (294), 23 states have internal predecessors, (294), 0 states have call successors, (0), 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 153 [2023-12-25 10:28:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:41,058 INFO L225 Difference]: With dead ends: 31221 [2023-12-25 10:28:41,058 INFO L226 Difference]: Without dead ends: 26827 [2023-12-25 10:28:41,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5863 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3525, Invalid=14565, Unknown=0, NotChecked=0, Total=18090 [2023-12-25 10:28:41,067 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 7164 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7164 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:41,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7164 Valid, 2027 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 10:28:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2023-12-25 10:28:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 4714. [2023-12-25 10:28:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4713 states have (on average 1.3439422872904732) internal successors, (6334), 4713 states have internal predecessors, (6334), 0 states have call successors, (0), 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-25 10:28:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 6334 transitions. [2023-12-25 10:28:41,177 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 6334 transitions. Word has length 153 [2023-12-25 10:28:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:41,177 INFO L495 AbstractCegarLoop]: Abstraction has 4714 states and 6334 transitions. [2023-12-25 10:28:41,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.25) internal successors, (294), 23 states have internal predecessors, (294), 0 states have call successors, (0), 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-25 10:28:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 6334 transitions. [2023-12-25 10:28:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 10:28:41,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:41,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:41,181 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 (56)] Ended with exit code 0 [2023-12-25 10:28:41,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /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-25 10:28:41,379 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:41,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash 733945113, now seen corresponding path program 1 times [2023-12-25 10:28:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:41,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972095292] [2023-12-25 10:28:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:41,380 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-25 10:28:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:41,381 INFO L229 MonitoredProcess]: Starting monitored process 57 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-25 10:28:41,381 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 (57)] Waiting until timeout for monitored process [2023-12-25 10:28:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:41,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:28:41,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:41,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:41,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972095292] [2023-12-25 10:28:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972095292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:28:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648083670] [2023-12-25 10:28:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:28:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:28:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:41,626 INFO L87 Difference]: Start difference. First operand 4714 states and 6334 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-25 10:28:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:41,659 INFO L93 Difference]: Finished difference Result 6914 states and 9300 transitions. [2023-12-25 10:28:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:28:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2023-12-25 10:28:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:41,662 INFO L225 Difference]: With dead ends: 6914 [2023-12-25 10:28:41,662 INFO L226 Difference]: Without dead ends: 2352 [2023-12-25 10:28:41,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:41,664 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 75 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:41,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 337 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:28:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2023-12-25 10:28:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2350. [2023-12-25 10:28:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.3222647935291614) internal successors, (3106), 2349 states have internal predecessors, (3106), 0 states have call successors, (0), 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-25 10:28:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3106 transitions. [2023-12-25 10:28:41,684 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3106 transitions. Word has length 154 [2023-12-25 10:28:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:41,684 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3106 transitions. [2023-12-25 10:28:41,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-25 10:28:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3106 transitions. [2023-12-25 10:28:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 10:28:41,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:41,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:41,692 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 (57)] Forceful destruction successful, exit code 0 [2023-12-25 10:28:41,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /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-25 10:28:41,889 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:41,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash 906473305, now seen corresponding path program 1 times [2023-12-25 10:28:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:41,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746552022] [2023-12-25 10:28:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:41,890 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-25 10:28:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:41,891 INFO L229 MonitoredProcess]: Starting monitored process 58 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-25 10:28:41,900 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 (58)] Waiting until timeout for monitored process [2023-12-25 10:28:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:42,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:28:42,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:43,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:28:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:43,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746552022] [2023-12-25 10:28:43,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746552022] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:28:43,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:28:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 10:28:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655970589] [2023-12-25 10:28:43,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:28:43,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:28:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:43,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:28:43,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:28:43,402 INFO L87 Difference]: Start difference. First operand 2350 states and 3106 transitions. Second operand has 24 states, 24 states have (on average 12.5) internal successors, (300), 23 states have internal predecessors, (300), 0 states have call successors, (0), 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-25 10:28:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:53,280 INFO L93 Difference]: Finished difference Result 15378 states and 20221 transitions. [2023-12-25 10:28:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 10:28:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 12.5) internal successors, (300), 23 states have internal predecessors, (300), 0 states have call successors, (0), 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 154 [2023-12-25 10:28:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:53,290 INFO L225 Difference]: With dead ends: 15378 [2023-12-25 10:28:53,290 INFO L226 Difference]: Without dead ends: 13180 [2023-12-25 10:28:53,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5837 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3525, Invalid=14565, Unknown=0, NotChecked=0, Total=18090 [2023-12-25 10:28:53,294 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 4927 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4927 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:53,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4927 Valid, 2697 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 10:28:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13180 states. [2023-12-25 10:28:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13180 to 2434. [2023-12-25 10:28:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.3160706946157008) internal successors, (3202), 2433 states have internal predecessors, (3202), 0 states have call successors, (0), 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-25 10:28:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3202 transitions. [2023-12-25 10:28:53,343 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3202 transitions. Word has length 154 [2023-12-25 10:28:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:53,343 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3202 transitions. [2023-12-25 10:28:53,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.5) internal successors, (300), 23 states have internal predecessors, (300), 0 states have call successors, (0), 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-25 10:28:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3202 transitions. [2023-12-25 10:28:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:53,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:53,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:53,347 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 (58)] Ended with exit code 0 [2023-12-25 10:28:53,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /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-25 10:28:53,545 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:53,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1045416000, now seen corresponding path program 1 times [2023-12-25 10:28:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239709122] [2023-12-25 10:28:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:53,546 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-25 10:28:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:53,547 INFO L229 MonitoredProcess]: Starting monitored process 59 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-25 10:28:53,547 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 (59)] Waiting until timeout for monitored process [2023-12-25 10:28:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:53,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:28:53,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:28:53,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:53,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239709122] [2023-12-25 10:28:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239709122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:28:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382987670] [2023-12-25 10:28:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:53,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:28:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:28:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:53,778 INFO L87 Difference]: Start difference. First operand 2434 states and 3202 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-25 10:28:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:53,805 INFO L93 Difference]: Finished difference Result 3578 states and 4716 transitions. [2023-12-25 10:28:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:28:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2023-12-25 10:28:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:53,806 INFO L225 Difference]: With dead ends: 3578 [2023-12-25 10:28:53,806 INFO L226 Difference]: Without dead ends: 1296 [2023-12-25 10:28:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:28:53,807 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 74 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 314 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:28:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-12-25 10:28:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1294. [2023-12-25 10:28:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 1.2838360402165507) internal successors, (1660), 1293 states have internal predecessors, (1660), 0 states have call successors, (0), 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-25 10:28:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1660 transitions. [2023-12-25 10:28:53,816 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1660 transitions. Word has length 155 [2023-12-25 10:28:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:53,816 INFO L495 AbstractCegarLoop]: Abstraction has 1294 states and 1660 transitions. [2023-12-25 10:28:53,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-25 10:28:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1660 transitions. [2023-12-25 10:28:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:53,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:53,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:53,824 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 (59)] Forceful destruction successful, exit code 0 [2023-12-25 10:28:54,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /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-25 10:28:54,021 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:54,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2036012928, now seen corresponding path program 1 times [2023-12-25 10:28:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:54,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48026944] [2023-12-25 10:28:54,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:54,022 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-25 10:28:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:54,023 INFO L229 MonitoredProcess]: Starting monitored process 60 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-25 10:28:54,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 (60)] Waiting until timeout for monitored process [2023-12-25 10:28:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:54,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:28:54,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 10:28:55,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:55,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48026944] [2023-12-25 10:28:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48026944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:28:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769294506] [2023-12-25 10:28:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:28:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:28:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:55,221 INFO L87 Difference]: Start difference. First operand 1294 states and 1660 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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-25 10:28:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:55,359 INFO L93 Difference]: Finished difference Result 3586 states and 4678 transitions. [2023-12-25 10:28:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:28:55,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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 155 [2023-12-25 10:28:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:55,363 INFO L225 Difference]: With dead ends: 3586 [2023-12-25 10:28:55,363 INFO L226 Difference]: Without dead ends: 3204 [2023-12-25 10:28:55,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:55,366 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 443 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:55,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 823 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:28:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2023-12-25 10:28:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2054. [2023-12-25 10:28:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.2781295664880663) internal successors, (2624), 2053 states have internal predecessors, (2624), 0 states have call successors, (0), 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-25 10:28:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2624 transitions. [2023-12-25 10:28:55,382 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2624 transitions. Word has length 155 [2023-12-25 10:28:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:55,382 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2624 transitions. [2023-12-25 10:28:55,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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-25 10:28:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2624 transitions. [2023-12-25 10:28:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:55,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:55,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:55,386 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 (60)] Ended with exit code 0 [2023-12-25 10:28:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /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-25 10:28:55,584 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:55,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -727104541, now seen corresponding path program 1 times [2023-12-25 10:28:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166015086] [2023-12-25 10:28:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:55,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-25 10:28:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:55,586 INFO L229 MonitoredProcess]: Starting monitored process 61 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-25 10:28:55,592 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 (61)] Waiting until timeout for monitored process [2023-12-25 10:28:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:55,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:28:55,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 10:28:56,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:56,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:56,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166015086] [2023-12-25 10:28:56,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166015086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:56,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:28:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794485566] [2023-12-25 10:28:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:28:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:56,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:28:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:56,746 INFO L87 Difference]: Start difference. First operand 2054 states and 2624 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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-25 10:28:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:56,871 INFO L93 Difference]: Finished difference Result 3966 states and 5160 transitions. [2023-12-25 10:28:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:28:56,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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 155 [2023-12-25 10:28:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:56,873 INFO L225 Difference]: With dead ends: 3966 [2023-12-25 10:28:56,874 INFO L226 Difference]: Without dead ends: 2824 [2023-12-25 10:28:56,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:56,875 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 490 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:56,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 803 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:28:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2023-12-25 10:28:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1674. [2023-12-25 10:28:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 1.2659892408846383) internal successors, (2118), 1673 states have internal predecessors, (2118), 0 states have call successors, (0), 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-25 10:28:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2118 transitions. [2023-12-25 10:28:56,886 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2118 transitions. Word has length 155 [2023-12-25 10:28:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:56,886 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2118 transitions. [2023-12-25 10:28:56,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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-25 10:28:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2118 transitions. [2023-12-25 10:28:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:56,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:56,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:56,890 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 (61)] Ended with exit code 0 [2023-12-25 10:28:57,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /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-25 10:28:57,088 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:57,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1099997059, now seen corresponding path program 1 times [2023-12-25 10:28:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326169798] [2023-12-25 10:28:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:57,088 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-25 10:28:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:57,089 INFO L229 MonitoredProcess]: Starting monitored process 62 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-25 10:28:57,090 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 (62)] Waiting until timeout for monitored process [2023-12-25 10:28:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:57,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:28:57,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 10:28:58,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:58,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:58,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326169798] [2023-12-25 10:28:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326169798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:58,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:28:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415997979] [2023-12-25 10:28:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:58,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:28:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:28:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:58,280 INFO L87 Difference]: Start difference. First operand 1674 states and 2118 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 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-25 10:28:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:58,408 INFO L93 Difference]: Finished difference Result 3586 states and 4654 transitions. [2023-12-25 10:28:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:28:58,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 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 155 [2023-12-25 10:28:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:58,411 INFO L225 Difference]: With dead ends: 3586 [2023-12-25 10:28:58,411 INFO L226 Difference]: Without dead ends: 3204 [2023-12-25 10:28:58,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:58,412 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 541 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:58,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 874 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:28:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2023-12-25 10:28:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2054. [2023-12-25 10:28:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 1.2664393570384802) internal successors, (2600), 2053 states have internal predecessors, (2600), 0 states have call successors, (0), 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-25 10:28:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2600 transitions. [2023-12-25 10:28:58,425 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2600 transitions. Word has length 155 [2023-12-25 10:28:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:58,425 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2600 transitions. [2023-12-25 10:28:58,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 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-25 10:28:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2600 transitions. [2023-12-25 10:28:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:58,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:58,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:58,429 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 (62)] Forceful destruction successful, exit code 0 [2023-12-25 10:28:58,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /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-25 10:28:58,626 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:28:58,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:28:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2000359456, now seen corresponding path program 1 times [2023-12-25 10:28:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:28:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419975524] [2023-12-25 10:28:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:28:58,627 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-25 10:28:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:28:58,628 INFO L229 MonitoredProcess]: Starting monitored process 63 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-25 10:28:58,629 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 (63)] Waiting until timeout for monitored process [2023-12-25 10:28:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:28:58,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:28:58,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:28:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 10:28:59,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:28:59,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:28:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419975524] [2023-12-25 10:28:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419975524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:28:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:28:59,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:28:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983742884] [2023-12-25 10:28:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:28:59,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:28:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:28:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:28:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:59,808 INFO L87 Difference]: Start difference. First operand 2054 states and 2600 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 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-25 10:28:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:28:59,928 INFO L93 Difference]: Finished difference Result 3966 states and 5136 transitions. [2023-12-25 10:28:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:28:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 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 155 [2023-12-25 10:28:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:28:59,931 INFO L225 Difference]: With dead ends: 3966 [2023-12-25 10:28:59,931 INFO L226 Difference]: Without dead ends: 3584 [2023-12-25 10:28:59,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:28:59,932 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 489 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:28:59,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 952 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:28:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2023-12-25 10:28:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2434. [2023-12-25 10:28:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.2667488697081792) internal successors, (3082), 2433 states have internal predecessors, (3082), 0 states have call successors, (0), 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-25 10:28:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3082 transitions. [2023-12-25 10:28:59,955 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3082 transitions. Word has length 155 [2023-12-25 10:28:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:28:59,955 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3082 transitions. [2023-12-25 10:28:59,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 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-25 10:28:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3082 transitions. [2023-12-25 10:28:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-25 10:28:59,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:28:59,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:28:59,964 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 (63)] Forceful destruction successful, exit code 0 [2023-12-25 10:29:00,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /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-25 10:29:00,161 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:29:00,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:29:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -125037789, now seen corresponding path program 1 times [2023-12-25 10:29:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:29:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902807293] [2023-12-25 10:29:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:29:00,162 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-25 10:29:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:29:00,163 INFO L229 MonitoredProcess]: Starting monitored process 64 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-25 10:29:00,164 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 (64)] Waiting until timeout for monitored process [2023-12-25 10:29:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:29:00,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 10:29:00,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:29:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 10:29:01,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:29:01,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:29:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902807293] [2023-12-25 10:29:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902807293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:29:01,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:29:01,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 10:29:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125942528] [2023-12-25 10:29:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:29:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 10:29:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:29:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 10:29:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:29:01,357 INFO L87 Difference]: Start difference. First operand 2434 states and 3082 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 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-25 10:29:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:29:01,466 INFO L93 Difference]: Finished difference Result 4346 states and 5618 transitions. [2023-12-25 10:29:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 10:29:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 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 155 [2023-12-25 10:29:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:29:01,469 INFO L225 Difference]: With dead ends: 4346 [2023-12-25 10:29:01,469 INFO L226 Difference]: Without dead ends: 3964 [2023-12-25 10:29:01,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-25 10:29:01,470 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 637 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:29:01,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 802 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:29:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2023-12-25 10:29:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 2814. [2023-12-25 10:29:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2813 states have (on average 1.266974760042659) internal successors, (3564), 2813 states have internal predecessors, (3564), 0 states have call successors, (0), 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-25 10:29:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3564 transitions. [2023-12-25 10:29:01,489 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3564 transitions. Word has length 155 [2023-12-25 10:29:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:29:01,489 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 3564 transitions. [2023-12-25 10:29:01,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 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-25 10:29:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3564 transitions. [2023-12-25 10:29:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 10:29:01,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:29:01,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:29:01,498 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 (64)] Forceful destruction successful, exit code 0 [2023-12-25 10:29:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /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-25 10:29:01,696 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:29:01,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:29:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1456539076, now seen corresponding path program 1 times [2023-12-25 10:29:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:29:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499533448] [2023-12-25 10:29:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:29:01,697 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-25 10:29:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:29:01,698 INFO L229 MonitoredProcess]: Starting monitored process 65 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-25 10:29:01,699 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 (65)] Waiting until timeout for monitored process [2023-12-25 10:29:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:29:01,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 10:29:01,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:29:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:29:09,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:29:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:29:15,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:29:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499533448] [2023-12-25 10:29:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499533448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:29:15,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:29:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2023-12-25 10:29:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188495558] [2023-12-25 10:29:15,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:29:15,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-25 10:29:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:29:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-25 10:29:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2330, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 10:29:15,017 INFO L87 Difference]: Start difference. First operand 2814 states and 3564 transitions. Second operand has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 states have internal predecessors, (296), 0 states have call successors, (0), 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-25 10:34:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:34:20,585 INFO L93 Difference]: Finished difference Result 54933 states and 70007 transitions. [2023-12-25 10:34:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2023-12-25 10:34:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 states have internal predecessors, (296), 0 states have call successors, (0), 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 156 [2023-12-25 10:34:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:34:20,630 INFO L225 Difference]: With dead ends: 54933 [2023-12-25 10:34:20,630 INFO L226 Difference]: Without dead ends: 52271 [2023-12-25 10:34:20,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40866 ImplicationChecksByTransitivity, 262.3s TimeCoverageRelationStatistics Valid=9853, Invalid=98715, Unknown=2, NotChecked=0, Total=108570 [2023-12-25 10:34:20,643 INFO L413 NwaCegarLoop]: 1302 mSDtfsCounter, 5994 mSDsluCounter, 31973 mSDsCounter, 0 mSdLazyCounter, 11485 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5994 SdHoareTripleChecker+Valid, 33275 SdHoareTripleChecker+Invalid, 11523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 11485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:34:20,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5994 Valid, 33275 Invalid, 11523 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 11485 Invalid, 0 Unknown, 0 Unchecked, 51.2s Time] [2023-12-25 10:34:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52271 states. [2023-12-25 10:34:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52271 to 13673. [2023-12-25 10:34:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13673 states, 13672 states have (on average 1.2712112346401405) internal successors, (17380), 13672 states have internal predecessors, (17380), 0 states have call successors, (0), 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-25 10:34:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13673 states to 13673 states and 17380 transitions. [2023-12-25 10:34:20,956 INFO L78 Accepts]: Start accepts. Automaton has 13673 states and 17380 transitions. Word has length 156 [2023-12-25 10:34:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:34:20,956 INFO L495 AbstractCegarLoop]: Abstraction has 13673 states and 17380 transitions. [2023-12-25 10:34:20,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 states have internal predecessors, (296), 0 states have call successors, (0), 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-25 10:34:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13673 states and 17380 transitions. [2023-12-25 10:34:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 10:34:20,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:34:20,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:34:20,963 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 (65)] Ended with exit code 0 [2023-12-25 10:34:21,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /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-25 10:34:21,160 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:34:21,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:34:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 453326177, now seen corresponding path program 1 times [2023-12-25 10:34:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:34:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344977958] [2023-12-25 10:34:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:34:21,162 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-25 10:34:21,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:34:21,163 INFO L229 MonitoredProcess]: Starting monitored process 66 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-25 10:34:21,165 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 (66)] Waiting until timeout for monitored process [2023-12-25 10:34:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:34:21,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:34:21,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:34:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:21,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:34:21,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:34:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344977958] [2023-12-25 10:34:21,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344977958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:34:21,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:34:21,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:34:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307296364] [2023-12-25 10:34:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:34:21,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:34:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:34:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:34:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:34:21,385 INFO L87 Difference]: Start difference. First operand 13673 states and 17380 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-25 10:34:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:34:21,427 INFO L93 Difference]: Finished difference Result 21293 states and 27065 transitions. [2023-12-25 10:34:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:34:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2023-12-25 10:34:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:34:21,433 INFO L225 Difference]: With dead ends: 21293 [2023-12-25 10:34:21,433 INFO L226 Difference]: Without dead ends: 8033 [2023-12-25 10:34:21,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:34:21,438 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:34:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 302 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:34:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2023-12-25 10:34:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 8031. [2023-12-25 10:34:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8031 states, 8030 states have (on average 1.248318804483188) internal successors, (10024), 8030 states have internal predecessors, (10024), 0 states have call successors, (0), 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-25 10:34:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8031 states to 8031 states and 10024 transitions. [2023-12-25 10:34:21,486 INFO L78 Accepts]: Start accepts. Automaton has 8031 states and 10024 transitions. Word has length 156 [2023-12-25 10:34:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:34:21,486 INFO L495 AbstractCegarLoop]: Abstraction has 8031 states and 10024 transitions. [2023-12-25 10:34:21,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-25 10:34:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 8031 states and 10024 transitions. [2023-12-25 10:34:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 10:34:21,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:34:21,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:34:21,492 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 (66)] Ended with exit code 0 [2023-12-25 10:34:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /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-25 10:34:21,690 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:34:21,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:34:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1111523711, now seen corresponding path program 1 times [2023-12-25 10:34:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:34:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411217975] [2023-12-25 10:34:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:34:21,691 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-25 10:34:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:34:21,692 INFO L229 MonitoredProcess]: Starting monitored process 67 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-25 10:34:21,692 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 (67)] Waiting until timeout for monitored process [2023-12-25 10:34:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:34:21,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 10:34:21,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:34:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:23,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:34:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:23,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:34:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411217975] [2023-12-25 10:34:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411217975] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:34:23,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:34:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-25 10:34:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526512889] [2023-12-25 10:34:23,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:34:23,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 10:34:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:34:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 10:34:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2023-12-25 10:34:23,290 INFO L87 Difference]: Start difference. First operand 8031 states and 10024 transitions. Second operand has 24 states, 24 states have (on average 11.708333333333334) internal successors, (281), 24 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:34:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:34:25,948 INFO L93 Difference]: Finished difference Result 33652 states and 42045 transitions. [2023-12-25 10:34:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 10:34:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.708333333333334) internal successors, (281), 24 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2023-12-25 10:34:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:34:25,980 INFO L225 Difference]: With dead ends: 33652 [2023-12-25 10:34:25,980 INFO L226 Difference]: Without dead ends: 31474 [2023-12-25 10:34:25,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 10:34:25,990 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 2209 mSDsluCounter, 4060 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:34:25,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 4414 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:34:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31474 states. [2023-12-25 10:34:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31474 to 10338. [2023-12-25 10:34:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10338 states, 10337 states have (on average 1.2484279771693916) internal successors, (12905), 10337 states have internal predecessors, (12905), 0 states have call successors, (0), 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-25 10:34:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10338 states to 10338 states and 12905 transitions. [2023-12-25 10:34:26,141 INFO L78 Accepts]: Start accepts. Automaton has 10338 states and 12905 transitions. Word has length 156 [2023-12-25 10:34:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:34:26,141 INFO L495 AbstractCegarLoop]: Abstraction has 10338 states and 12905 transitions. [2023-12-25 10:34:26,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.708333333333334) internal successors, (281), 24 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:34:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10338 states and 12905 transitions. [2023-12-25 10:34:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 10:34:26,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:34:26,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:34:26,147 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 (67)] Forceful destruction successful, exit code 0 [2023-12-25 10:34:26,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /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-25 10:34:26,345 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:34:26,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:34:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 871110260, now seen corresponding path program 1 times [2023-12-25 10:34:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:34:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282673729] [2023-12-25 10:34:26,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:34:26,346 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-25 10:34:26,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:34:26,348 INFO L229 MonitoredProcess]: Starting monitored process 68 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-25 10:34:26,356 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 (68)] Waiting until timeout for monitored process [2023-12-25 10:34:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:34:26,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:34:26,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:34:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:27,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:34:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:27,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:34:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282673729] [2023-12-25 10:34:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282673729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:34:27,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:34:27,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:34:27,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279303669] [2023-12-25 10:34:27,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:34:27,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:34:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:34:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:34:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:34:27,776 INFO L87 Difference]: Start difference. First operand 10338 states and 12905 transitions. Second operand has 21 states, 21 states have (on average 13.714285714285714) internal successors, (288), 21 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:34:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:34:30,319 INFO L93 Difference]: Finished difference Result 46603 states and 57875 transitions. [2023-12-25 10:34:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-25 10:34:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.714285714285714) internal successors, (288), 21 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2023-12-25 10:34:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:34:30,351 INFO L225 Difference]: With dead ends: 46603 [2023-12-25 10:34:30,352 INFO L226 Difference]: Without dead ends: 43745 [2023-12-25 10:34:30,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=701, Invalid=2379, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 10:34:30,362 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 2775 mSDsluCounter, 3808 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:34:30,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 4131 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 10:34:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43745 states. [2023-12-25 10:34:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43745 to 20165. [2023-12-25 10:34:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20165 states, 20164 states have (on average 1.248908946637572) internal successors, (25183), 20164 states have internal predecessors, (25183), 0 states have call successors, (0), 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-25 10:34:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20165 states to 20165 states and 25183 transitions. [2023-12-25 10:34:30,602 INFO L78 Accepts]: Start accepts. Automaton has 20165 states and 25183 transitions. Word has length 156 [2023-12-25 10:34:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:34:30,602 INFO L495 AbstractCegarLoop]: Abstraction has 20165 states and 25183 transitions. [2023-12-25 10:34:30,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.714285714285714) internal successors, (288), 21 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:34:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 20165 states and 25183 transitions. [2023-12-25 10:34:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 10:34:30,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:34:30,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:34:30,610 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 (68)] Ended with exit code 0 [2023-12-25 10:34:30,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /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-25 10:34:30,807 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-12-25 10:34:30,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:34:30,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1919389393, now seen corresponding path program 1 times [2023-12-25 10:34:30,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:34:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370366689] [2023-12-25 10:34:30,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:34:30,809 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-25 10:34:30,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:34:30,810 INFO L229 MonitoredProcess]: Starting monitored process 69 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-25 10:34:30,810 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 (69)] Waiting until timeout for monitored process [2023-12-25 10:34:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:34:31,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-25 10:34:31,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:34:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:34,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:34:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:34:36,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:34:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370366689] [2023-12-25 10:34:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370366689] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:34:36,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:34:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-12-25 10:34:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473711203] [2023-12-25 10:34:36,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:34:36,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-25 10:34:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:34:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-25 10:34:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2101, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 10:34:36,390 INFO L87 Difference]: Start difference. First operand 20165 states and 25183 transitions. Second operand has 49 states, 49 states have (on average 6.163265306122449) internal successors, (302), 49 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-25 10:39:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 635 states. [2023-12-25 10:39:28,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 671 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201518 ImplicationChecksByTransitivity, 267.9s TimeCoverageRelationStatistics Valid=41010, Invalid=411246, Unknown=0, NotChecked=0, Total=452256 [2023-12-25 10:39:28,992 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 7814 mSDsluCounter, 20257 mSDsCounter, 0 mSdLazyCounter, 10705 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7814 SdHoareTripleChecker+Valid, 21139 SdHoareTripleChecker+Invalid, 10806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 10705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:39:28,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7814 Valid, 21139 Invalid, 10806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [101 Valid, 10705 Invalid, 0 Unknown, 0 Unchecked, 24.2s Time] [2023-12-25 10:39:28,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-12-25 10:39:28,996 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 (69)] Ended with exit code 0 [2023-12-25 10:39:29,010 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 (69)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 10:39:29,010 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-25 10:39:29,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /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-25 10:39:29,194 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-12-25 10:39:29,195 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-12-25 10:39:29,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-12-25 10:39:29,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 10:39:29,200 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:39:29,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:39:29 BoogieIcfgContainer [2023-12-25 10:39:29,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:39:29,201 INFO L158 Benchmark]: Toolchain (without parser) took 852631.17ms. Allocated memory was 228.6MB in the beginning and 929.0MB in the end (delta: 700.4MB). Free memory was 171.2MB in the beginning and 166.5MB in the end (delta: 4.7MB). Peak memory consumption was 705.6MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 189.8MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1060.07ms. Allocated memory is still 228.6MB. Free memory was 170.7MB in the beginning and 162.4MB in the end (delta: 8.3MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.95ms. Allocated memory is still 228.6MB. Free memory was 161.9MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: Boogie Preprocessor took 141.36ms. Allocated memory is still 228.6MB. Free memory was 150.3MB in the beginning and 136.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: RCFGBuilder took 2398.89ms. Allocated memory was 228.6MB in the beginning and 303.0MB in the end (delta: 74.4MB). Free memory was 136.7MB in the beginning and 172.8MB in the end (delta: -36.1MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,201 INFO L158 Benchmark]: TraceAbstraction took 848877.95ms. Allocated memory was 303.0MB in the beginning and 929.0MB in the end (delta: 626.0MB). Free memory was 171.8MB in the beginning and 166.5MB in the end (delta: 5.2MB). Peak memory consumption was 630.7MB. Max. memory is 8.0GB. [2023-12-25 10:39:29,202 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.18ms. Allocated memory is still 189.8MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1060.07ms. Allocated memory is still 228.6MB. Free memory was 170.7MB in the beginning and 162.4MB in the end (delta: 8.3MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 145.95ms. Allocated memory is still 228.6MB. Free memory was 161.9MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 141.36ms. Allocated memory is still 228.6MB. Free memory was 150.3MB in the beginning and 136.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2398.89ms. Allocated memory was 228.6MB in the beginning and 303.0MB in the end (delta: 74.4MB). Free memory was 136.7MB in the beginning and 172.8MB in the end (delta: -36.1MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. * TraceAbstraction took 848877.95ms. Allocated memory was 303.0MB in the beginning and 929.0MB in the end (delta: 626.0MB). Free memory was 171.8MB in the beginning and 166.5MB in the end (delta: 5.2MB). Peak memory consumption was 630.7MB. 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: 598]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 598). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 934]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 934). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1026). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1077]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1077). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1196]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1196). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1247]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1247). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1325]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1325). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1508]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1508). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1559]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1559). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1637]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1637). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 1779]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1779). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 2077]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2077). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 2128]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2128). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 2206]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2206). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 2348]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2348). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - TimeoutResultAtElement [Line: 2595]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2595). Cancelled while NwaCegarLoop was constructing difference of abstraction (20165states) and FLOYD_HOARE automaton (currently 635 states, 49 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 673 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 624 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 848.8s, OverallIterations: 68, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 746.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114561 SdHoareTripleChecker+Valid, 163.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114561 mSDsluCounter, 130918 SdHoareTripleChecker+Invalid, 155.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110636 mSDsCounter, 694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66433 IncrementalHoareTripleChecker+Invalid, 67127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 694 mSolverCounterUnsat, 20282 mSDtfsCounter, 66433 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10343 GetRequests, 7865 SyntacticMatches, 0 SemanticMatches, 2477 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305757 ImplicationChecksByTransitivity, 607.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20165occurred in iteration=67, InterpolantAutomatonStates: 1534, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 67 MinimizatonAttempts, 268957 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.7s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 74.4s InterpolantComputationTime, 7143 NumberOfCodeBlocks, 7143 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8451 ConstructedInterpolants, 3188 QuantifiedInterpolants, 122439 SizeOfPredicates, 374 NumberOfNonLiveVariables, 20598 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 77 InterpolantComputations, 59 PerfectInterpolantSequences, 351/463 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