/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-pthread/cs_fib-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:34:48,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:34:48,650 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 11:34:48,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:34:48,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:34:48,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:34:48,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:34:48,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:34:48,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:34:48,671 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:34:48,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:34:48,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:34:48,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:34:48,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:34:48,679 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:34:48,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:34:48,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:34:48,681 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:34:48,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:34:48,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:34:48,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:34:48,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:34:48,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:34:48,683 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:34:48,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:34:48,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:34:48,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:34:48,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:34:48,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:34:48,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:34:48,686 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:34:48,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:34:48,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:34:48,686 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:34:48,686 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 11:34:48,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:34:48,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:34:48,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:34:48,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:34:48,859 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:34:48,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_fib-2.i [2023-12-25 11:34:49,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:34:50,128 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:34:50,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_fib-2.i [2023-12-25 11:34:50,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bae30a16/1e76503f4228427c86e8b28fdf23d4d5/FLAG83c2c7362 [2023-12-25 11:34:50,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bae30a16/1e76503f4228427c86e8b28fdf23d4d5 [2023-12-25 11:34:50,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:34:50,188 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:34:50,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:34:50,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:34:50,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:34:50,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575bc825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50, skipping insertion in model container [2023-12-25 11:34:50,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:34:50,464 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-pthread/cs_fib-2.i[23457,23470] [2023-12-25 11:34:50,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:34:50,584 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:34:50,649 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-pthread/cs_fib-2.i[23457,23470] [2023-12-25 11:34:50,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:34:50,775 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:34:50,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50 WrapperNode [2023-12-25 11:34:50,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:34:50,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:34:50,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:34:50,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:34:50,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,874 INFO L138 Inliner]: procedures = 148, calls = 356, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 673 [2023-12-25 11:34:50,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:34:50,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:34:50,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:34:50,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:34:50,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,956 INFO L175 MemorySlicer]: Split 225 memory accesses to 14 slices as follows [2, 8, 8, 36, 31, 22, 22, 0, 11, 10, 2, 11, 31, 31]. 16 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [2, 3, 3, 0, 0, 6, 6, 0, 0, 6, 0, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 21, 16, 7, 7, 0, 1, 2, 2, 1, 1, 1]. [2023-12-25 11:34:50,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:50,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:51,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:34:51,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:34:51,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:34:51,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:34:51,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (1/1) ... [2023-12-25 11:34:51,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:34:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:34:51,046 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 11:34:51,048 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 11:34:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:34:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:34:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:34:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:34:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:34:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:34:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:34:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:34:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:34:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 11:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:34:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:34:51,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:34:51,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 11:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:34:51,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:34:51,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:34:51,392 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:34:51,394 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:34:52,313 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2023-12-25 11:34:52,314 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:34:56,975 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:34:57,018 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:34:57,018 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-25 11:34:57,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:34:57 BoogieIcfgContainer [2023-12-25 11:34:57,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:34:57,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:34:57,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:34:57,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:34:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:34:50" (1/3) ... [2023-12-25 11:34:57,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb47006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:34:57, skipping insertion in model container [2023-12-25 11:34:57,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:34:50" (2/3) ... [2023-12-25 11:34:57,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb47006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:34:57, skipping insertion in model container [2023-12-25 11:34:57,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:34:57" (3/3) ... [2023-12-25 11:34:57,025 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2023-12-25 11:34:57,038 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:34:57,039 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:34:57,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:34:57,091 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;@7e598c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:34:57,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:34:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 100 states have (on average 1.37) internal successors, (137), 101 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-25 11:34:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-25 11:34:57,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:34:57,116 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:57,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:34:57,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:34:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash -792630857, now seen corresponding path program 1 times [2023-12-25 11:34:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:34:57,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822420230] [2023-12-25 11:34:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:34:57,132 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 11:34:57,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:34:57,137 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 11:34:57,138 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 11:34:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:34:57,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:34:57,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:34:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-12-25 11:34:58,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:34:58,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:34:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822420230] [2023-12-25 11:34:58,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822420230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:34:58,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:34:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:34:58,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513796156] [2023-12-25 11:34:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:34:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:34:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:34:58,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:34:58,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:34:58,112 INFO L87 Difference]: Start difference. First operand has 173 states, 100 states have (on average 1.37) internal successors, (137), 101 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:02,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:02,639 INFO L93 Difference]: Finished difference Result 348 states and 608 transitions. [2023-12-25 11:35:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2023-12-25 11:35:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:02,671 INFO L225 Difference]: With dead ends: 348 [2023-12-25 11:35:02,672 INFO L226 Difference]: Without dead ends: 174 [2023-12-25 11:35:02,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:02,678 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:02,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 508 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 11:35:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-25 11:35:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2023-12-25 11:35:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 100 states have (on average 1.31) internal successors, (131), 101 states have internal predecessors, (131), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 11:35:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2023-12-25 11:35:02,743 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 253 [2023-12-25 11:35:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:02,743 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2023-12-25 11:35:02,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2023-12-25 11:35:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-25 11:35:02,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:02,749 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:02,762 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 11:35:02,965 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 11:35:02,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:02,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1118766462, now seen corresponding path program 1 times [2023-12-25 11:35:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074746464] [2023-12-25 11:35:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:02,968 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 11:35:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:02,969 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 11:35:02,984 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 11:35:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:03,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:35:03,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-12-25 11:35:03,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:03,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074746464] [2023-12-25 11:35:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074746464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:03,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:03,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:35:03,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400495329] [2023-12-25 11:35:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:35:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:35:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:03,756 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:04,308 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2023-12-25 11:35:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:04,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2023-12-25 11:35:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:04,311 INFO L225 Difference]: With dead ends: 343 [2023-12-25 11:35:04,311 INFO L226 Difference]: Without dead ends: 173 [2023-12-25 11:35:04,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:04,312 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:04,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 11:35:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-25 11:35:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-12-25 11:35:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 101 states have (on average 1.306930693069307) internal successors, (132), 102 states have internal predecessors, (132), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 11:35:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2023-12-25 11:35:04,325 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 256 [2023-12-25 11:35:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:04,325 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2023-12-25 11:35:04,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2023-12-25 11:35:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-25 11:35:04,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:04,328 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:04,340 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 11:35:04,539 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 11:35:04,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:04,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1777653054, now seen corresponding path program 1 times [2023-12-25 11:35:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430195045] [2023-12-25 11:35:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:04,541 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 11:35:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:04,547 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 11:35:04,548 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 11:35:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:05,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:35:05,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-12-25 11:35:05,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:35:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-12-25 11:35:05,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430195045] [2023-12-25 11:35:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430195045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:35:05,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:35:05,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 11:35:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989053879] [2023-12-25 11:35:05,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:35:05,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:35:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:35:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:05,677 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2023-12-25 11:35:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:07,184 INFO L93 Difference]: Finished difference Result 346 states and 528 transitions. [2023-12-25 11:35:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:35:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 257 [2023-12-25 11:35:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:07,186 INFO L225 Difference]: With dead ends: 346 [2023-12-25 11:35:07,186 INFO L226 Difference]: Without dead ends: 175 [2023-12-25 11:35:07,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:07,188 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:07,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1267 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 11:35:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-25 11:35:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-25 11:35:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 104 states have internal predecessors, (134), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 11:35:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2023-12-25 11:35:07,203 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 257 [2023-12-25 11:35:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:07,204 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2023-12-25 11:35:07,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2023-12-25 11:35:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2023-12-25 11:35:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-25 11:35:07,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:07,207 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:07,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 11:35:07,417 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 11:35:07,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:07,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1692691902, now seen corresponding path program 2 times [2023-12-25 11:35:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:07,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725564445] [2023-12-25 11:35:07,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:35:07,420 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 11:35:07,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:07,421 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 11:35:07,454 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 11:35:07,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:35:07,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:35:07,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 11:35:07,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2023-12-25 11:35:08,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:08,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:08,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725564445] [2023-12-25 11:35:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725564445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:35:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515626814] [2023-12-25 11:35:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:08,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:35:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:08,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:35:08,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:08,074 INFO L87 Difference]: Start difference. First operand 175 states and 265 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:08,572 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2023-12-25 11:35:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 259 [2023-12-25 11:35:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:08,577 INFO L225 Difference]: With dead ends: 337 [2023-12-25 11:35:08,577 INFO L226 Difference]: Without dead ends: 175 [2023-12-25 11:35:08,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 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 11:35:08,579 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 11:35:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-25 11:35:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-25 11:35:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 104 states have internal predecessors, (133), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 11:35:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2023-12-25 11:35:08,597 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 259 [2023-12-25 11:35:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:08,597 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 264 transitions. [2023-12-25 11:35:08,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 264 transitions. [2023-12-25 11:35:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2023-12-25 11:35:08,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:08,605 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:08,624 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 (5)] Ended with exit code 0 [2023-12-25 11:35:08,813 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 11:35:08,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:08,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1224383863, now seen corresponding path program 1 times [2023-12-25 11:35:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368472154] [2023-12-25 11:35:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:08,816 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 11:35:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:08,817 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 11:35:08,819 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 11:35:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:09,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:35:09,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3287 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3286 trivial. 0 not checked. [2023-12-25 11:35:09,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:35:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3287 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3286 trivial. 0 not checked. [2023-12-25 11:35:10,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368472154] [2023-12-25 11:35:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368472154] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:35:10,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:35:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 11:35:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358839019] [2023-12-25 11:35:10,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:35:10,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:35:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:35:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:10,436 INFO L87 Difference]: Start difference. First operand 175 states and 264 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2023-12-25 11:35:15,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:19,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:23,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:27,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:35:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:27,849 INFO L93 Difference]: Finished difference Result 360 states and 542 transitions. [2023-12-25 11:35:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:35:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 278 [2023-12-25 11:35:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:27,851 INFO L225 Difference]: With dead ends: 360 [2023-12-25 11:35:27,851 INFO L226 Difference]: Without dead ends: 193 [2023-12-25 11:35:27,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:35:27,852 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 12 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:27,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 757 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2023-12-25 11:35:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-25 11:35:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-12-25 11:35:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 122 states have internal predecessors, (154), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-25 11:35:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 285 transitions. [2023-12-25 11:35:27,868 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 285 transitions. Word has length 278 [2023-12-25 11:35:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:27,868 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 285 transitions. [2023-12-25 11:35:27,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2023-12-25 11:35:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 285 transitions. [2023-12-25 11:35:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2023-12-25 11:35:27,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:27,871 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:27,886 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 11:35:28,072 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 11:35:28,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:28,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1874157250, now seen corresponding path program 2 times [2023-12-25 11:35:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:28,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779048599] [2023-12-25 11:35:28,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:35:28,074 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 11:35:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:28,076 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 11:35:28,076 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 11:35:28,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:35:28,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:35:28,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:35:28,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 3256 trivial. 0 not checked. [2023-12-25 11:35:47,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:47,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779048599] [2023-12-25 11:35:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779048599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:35:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585910538] [2023-12-25 11:35:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:47,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 11:35:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 11:35:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:35:47,288 INFO L87 Difference]: Start difference. First operand 193 states and 285 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2023-12-25 11:35:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:58,805 INFO L93 Difference]: Finished difference Result 366 states and 547 transitions. [2023-12-25 11:35:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:35:58,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 296 [2023-12-25 11:35:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:58,810 INFO L225 Difference]: With dead ends: 366 [2023-12-25 11:35:58,810 INFO L226 Difference]: Without dead ends: 364 [2023-12-25 11:35:58,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:35:58,811 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 439 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:58,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 680 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-12-25 11:35:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-12-25 11:35:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2023-12-25 11:35:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 218 states have (on average 1.2798165137614679) internal successors, (279), 220 states have internal predecessors, (279), 131 states have call successors, (131), 11 states have call predecessors, (131), 12 states have return successors, (134), 130 states have call predecessors, (134), 129 states have call successors, (134) [2023-12-25 11:35:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2023-12-25 11:35:58,839 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 296 [2023-12-25 11:35:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:58,839 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2023-12-25 11:35:58,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (44), 4 states have call predecessors, (44), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2023-12-25 11:35:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2023-12-25 11:35:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-12-25 11:35:58,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:58,843 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:35:58,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:59,051 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 11:35:59,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:59,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2051689955, now seen corresponding path program 1 times [2023-12-25 11:35:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64263671] [2023-12-25 11:35:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:59,054 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 11:35:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:59,055 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 11:35:59,056 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 11:35:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:59,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:35:59,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3418 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2023-12-25 11:36:01,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3418 backedges. 2 proven. 112 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2023-12-25 11:36:03,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64263671] [2023-12-25 11:36:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64263671] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:03,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:03,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-25 11:36:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019266264] [2023-12-25 11:36:03,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 11:36:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 11:36:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-25 11:36:03,313 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand has 12 states, 12 states have (on average 9.583333333333334) internal successors, (115), 12 states have internal predecessors, (115), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-12-25 11:36:10,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:14,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:18,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:22,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:26,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:31,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:35,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:39,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:43,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:47,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:47,867 INFO L93 Difference]: Finished difference Result 710 states and 1073 transitions. [2023-12-25 11:36:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:36:47,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.583333333333334) internal successors, (115), 12 states have internal predecessors, (115), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 301 [2023-12-25 11:36:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:47,871 INFO L225 Difference]: With dead ends: 710 [2023-12-25 11:36:47,871 INFO L226 Difference]: Without dead ends: 374 [2023-12-25 11:36:47,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-25 11:36:47,873 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:47,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2026 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 44.5s Time] [2023-12-25 11:36:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-25 11:36:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2023-12-25 11:36:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 230 states have (on average 1.2739130434782608) internal successors, (293), 232 states have internal predecessors, (293), 131 states have call successors, (131), 11 states have call predecessors, (131), 12 states have return successors, (134), 130 states have call predecessors, (134), 129 states have call successors, (134) [2023-12-25 11:36:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 558 transitions. [2023-12-25 11:36:47,899 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 558 transitions. Word has length 301 [2023-12-25 11:36:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:47,899 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 558 transitions. [2023-12-25 11:36:47,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.583333333333334) internal successors, (115), 12 states have internal predecessors, (115), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2023-12-25 11:36:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 558 transitions. [2023-12-25 11:36:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-12-25 11:36:47,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:47,902 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:47,939 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 11:36:48,138 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 11:36:48,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:48,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash -108378901, now seen corresponding path program 2 times [2023-12-25 11:36:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127035315] [2023-12-25 11:36:48,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:36:48,141 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 11:36:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:48,144 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 11:36:48,177 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 11:36:48,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:36:48,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:36:48,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:36:48,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:49,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-25 11:36:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-25 11:36:49,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-25 11:36:49,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-25 11:36:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2023-12-25 11:36:50,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:50,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127035315] [2023-12-25 11:36:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127035315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 11:36:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457065420] [2023-12-25 11:36:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:36:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:36:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:36:50,159 INFO L87 Difference]: Start difference. First operand 374 states and 558 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (45), 2 states have call predecessors, (45), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2023-12-25 11:36:54,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:59,713 INFO L93 Difference]: Finished difference Result 1043 states and 1592 transitions. [2023-12-25 11:36:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:59,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (45), 2 states have call predecessors, (45), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) Word has length 313 [2023-12-25 11:36:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:59,718 INFO L225 Difference]: With dead ends: 1043 [2023-12-25 11:36:59,718 INFO L226 Difference]: Without dead ends: 715 [2023-12-25 11:36:59,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:59,720 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 297 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:59,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 660 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2023-12-25 11:36:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-25 11:36:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 376. [2023-12-25 11:36:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 131 states have call successors, (131), 11 states have call predecessors, (131), 13 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:36:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2023-12-25 11:36:59,801 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 313 [2023-12-25 11:36:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:59,801 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2023-12-25 11:36:59,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (45), 2 states have call predecessors, (45), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2023-12-25 11:36:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2023-12-25 11:36:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-25 11:36:59,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:59,805 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:36:59,819 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 11:37:00,016 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 11:37:00,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:00,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -154302962, now seen corresponding path program 1 times [2023-12-25 11:37:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742037519] [2023-12-25 11:37:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:00,018 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 11:37:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:00,019 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 11:37:00,053 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 11:37:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:01,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:01,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 160 proven. 2 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2023-12-25 11:37:26,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:37:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3594 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3592 trivial. 0 not checked. [2023-12-25 11:37:33,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742037519] [2023-12-25 11:37:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742037519] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:37:33,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:37:33,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-25 11:37:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276435394] [2023-12-25 11:37:33,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:33,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:37:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:37:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:37:33,281 INFO L87 Difference]: Start difference. First operand 376 states and 561 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2023-12-25 11:37:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:39,052 INFO L93 Difference]: Finished difference Result 384 states and 567 transitions. [2023-12-25 11:37:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:37:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 312 [2023-12-25 11:37:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:39,055 INFO L225 Difference]: With dead ends: 384 [2023-12-25 11:37:39,055 INFO L226 Difference]: Without dead ends: 382 [2023-12-25 11:37:39,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-25 11:37:39,056 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 290 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:39,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 876 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-25 11:37:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-25 11:37:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2023-12-25 11:37:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 237 states have internal predecessors, (297), 131 states have call successors, (131), 12 states have call predecessors, (131), 14 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:37:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 564 transitions. [2023-12-25 11:37:39,122 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 564 transitions. Word has length 312 [2023-12-25 11:37:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:39,123 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 564 transitions. [2023-12-25 11:37:39,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2023-12-25 11:37:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 564 transitions. [2023-12-25 11:37:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-12-25 11:37:39,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:39,127 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:37:39,148 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 11:37:39,348 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 11:37:39,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:39,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash 789828211, now seen corresponding path program 1 times [2023-12-25 11:37:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:39,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830281427] [2023-12-25 11:37:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:39,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 11:37:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:39,354 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 11:37:39,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 (11)] Waiting until timeout for monitored process [2023-12-25 11:37:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:40,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:40,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 3436 trivial. 0 not checked. [2023-12-25 11:38:06,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:38:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2023-12-25 11:38:12,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830281427] [2023-12-25 11:38:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830281427] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:38:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:38:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-25 11:38:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539124147] [2023-12-25 11:38:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:12,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:38:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:38:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:38:12,982 INFO L87 Difference]: Start difference. First operand 380 states and 564 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2023-12-25 11:38:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:19,028 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2023-12-25 11:38:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:38:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 317 [2023-12-25 11:38:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:19,031 INFO L225 Difference]: With dead ends: 388 [2023-12-25 11:38:19,031 INFO L226 Difference]: Without dead ends: 386 [2023-12-25 11:38:19,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-25 11:38:19,032 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 222 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:19,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 933 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 11:38:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-25 11:38:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2023-12-25 11:38:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 240 states have internal predecessors, (300), 131 states have call successors, (131), 13 states have call predecessors, (131), 15 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:38:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 567 transitions. [2023-12-25 11:38:19,084 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 567 transitions. Word has length 317 [2023-12-25 11:38:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:19,087 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 567 transitions. [2023-12-25 11:38:19,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2023-12-25 11:38:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 567 transitions. [2023-12-25 11:38:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2023-12-25 11:38:19,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:19,090 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:38:19,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 11:38:19,305 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 11:38:19,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:19,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1890347794, now seen corresponding path program 1 times [2023-12-25 11:38:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550561559] [2023-12-25 11:38:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:19,309 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 11:38:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:19,310 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 11:38:19,312 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 11:38:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:20,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:38:20,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2023-12-25 11:38:47,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:38:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3604 trivial. 0 not checked. [2023-12-25 11:38:55,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550561559] [2023-12-25 11:38:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550561559] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:38:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:38:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-25 11:38:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471078849] [2023-12-25 11:38:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:55,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:38:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:55,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:38:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:38:55,147 INFO L87 Difference]: Start difference. First operand 384 states and 567 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-25 11:39:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:02,640 INFO L93 Difference]: Finished difference Result 392 states and 573 transitions. [2023-12-25 11:39:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:39:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 322 [2023-12-25 11:39:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:02,642 INFO L225 Difference]: With dead ends: 392 [2023-12-25 11:39:02,642 INFO L226 Difference]: Without dead ends: 390 [2023-12-25 11:39:02,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-25 11:39:02,643 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 222 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:02,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 933 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-25 11:39:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-25 11:39:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2023-12-25 11:39:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 240 states have (on average 1.2625) internal successors, (303), 243 states have internal predecessors, (303), 131 states have call successors, (131), 14 states have call predecessors, (131), 16 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:39:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 570 transitions. [2023-12-25 11:39:02,678 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 570 transitions. Word has length 322 [2023-12-25 11:39:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:02,678 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 570 transitions. [2023-12-25 11:39:02,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-25 11:39:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 570 transitions. [2023-12-25 11:39:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-12-25 11:39:02,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:02,681 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:02,700 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 11:39:02,899 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 11:39:02,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:02,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1553874707, now seen corresponding path program 1 times [2023-12-25 11:39:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782886066] [2023-12-25 11:39:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:02,902 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 11:39:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:02,903 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 11:39:02,905 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 11:39:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:04,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:39:04,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3624 backedges. 160 proven. 8 refuted. 0 times theorem prover too weak. 3456 trivial. 0 not checked. [2023-12-25 11:39:31,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3624 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2023-12-25 11:39:38,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:38,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782886066] [2023-12-25 11:39:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782886066] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:39:38,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:39:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-25 11:39:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764591175] [2023-12-25 11:39:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:39:38,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:39:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:39:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:39:38,978 INFO L87 Difference]: Start difference. First operand 388 states and 570 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-12-25 11:39:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:45,666 INFO L93 Difference]: Finished difference Result 396 states and 576 transitions. [2023-12-25 11:39:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:39:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 327 [2023-12-25 11:39:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:45,668 INFO L225 Difference]: With dead ends: 396 [2023-12-25 11:39:45,668 INFO L226 Difference]: Without dead ends: 394 [2023-12-25 11:39:45,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-25 11:39:45,669 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 222 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:45,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 933 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-25 11:39:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-25 11:39:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2023-12-25 11:39:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 246 states have internal predecessors, (306), 131 states have call successors, (131), 15 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:39:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2023-12-25 11:39:45,726 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 327 [2023-12-25 11:39:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2023-12-25 11:39:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2023-12-25 11:39:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2023-12-25 11:39:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2023-12-25 11:39:45,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:45,729 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:45,749 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 11:39:45,947 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 11:39:45,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:45,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1532085298, now seen corresponding path program 1 times [2023-12-25 11:39:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:45,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545187328] [2023-12-25 11:39:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:45,949 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 11:39:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:45,969 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 11:39:45,980 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 11:39:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:47,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:39:47,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 160 proven. 10 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2023-12-25 11:40:15,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:40:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3632 trivial. 0 not checked. [2023-12-25 11:40:23,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:40:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545187328] [2023-12-25 11:40:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545187328] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:40:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:40:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-25 11:40:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439766791] [2023-12-25 11:40:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:40:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:40:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:40:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:40:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:40:23,244 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2023-12-25 11:40:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:40:30,030 INFO L93 Difference]: Finished difference Result 400 states and 579 transitions. [2023-12-25 11:40:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:40:30,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 332 [2023-12-25 11:40:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:40:30,033 INFO L225 Difference]: With dead ends: 400 [2023-12-25 11:40:30,033 INFO L226 Difference]: Without dead ends: 396 [2023-12-25 11:40:30,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-25 11:40:30,034 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 222 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:40:30,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 933 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-25 11:40:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-25 11:40:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2023-12-25 11:40:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 245 states have (on average 1.2530612244897958) internal successors, (307), 247 states have internal predecessors, (307), 131 states have call successors, (131), 16 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2023-12-25 11:40:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2023-12-25 11:40:30,073 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 332 [2023-12-25 11:40:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:40:30,074 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2023-12-25 11:40:30,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2023-12-25 11:40:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2023-12-25 11:40:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2023-12-25 11:40:30,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:40:30,100 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 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, 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 11:40:30,141 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 11:40:30,301 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 11:40:30,302 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:40:30,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:40:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1314388045, now seen corresponding path program 1 times [2023-12-25 11:40:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:40:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594284248] [2023-12-25 11:40:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:40:30,304 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 11:40:30,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:40:30,317 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 11:40:30,353 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 11:40:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:40:31,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 11:40:31,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 800 proven. 7 refuted. 0 times theorem prover too weak. 3516 trivial. 0 not checked. [2023-12-25 11:40:34,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:40:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2023-12-25 11:40:38,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:40:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594284248] [2023-12-25 11:40:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594284248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:40:38,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:40:38,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:40:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475141480] [2023-12-25 11:40:38,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:40:38,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:40:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:40:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:40:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:40:38,050 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (94), 4 states have call predecessors, (94), 6 states have return successors, (93), 7 states have call predecessors, (93), 7 states have call successors, (93) [2023-12-25 11:40:42,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:46,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:41:05,829 INFO L93 Difference]: Finished difference Result 1167 states and 1727 transitions. [2023-12-25 11:41:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:41:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (94), 4 states have call predecessors, (94), 6 states have return successors, (93), 7 states have call predecessors, (93), 7 states have call successors, (93) Word has length 369 [2023-12-25 11:41:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:41:05,833 INFO L225 Difference]: With dead ends: 1167 [2023-12-25 11:41:05,833 INFO L226 Difference]: Without dead ends: 814 [2023-12-25 11:41:05,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:41:05,835 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 524 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 319 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:41:05,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 730 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 666 Invalid, 2 Unknown, 0 Unchecked, 27.2s Time] [2023-12-25 11:41:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2023-12-25 11:41:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 728. [2023-12-25 11:41:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 443 states have (on average 1.257336343115124) internal successors, (557), 448 states have internal predecessors, (557), 251 states have call successors, (251), 30 states have call predecessors, (251), 33 states have return successors, (278), 249 states have call predecessors, (278), 249 states have call successors, (278) [2023-12-25 11:41:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1086 transitions. [2023-12-25 11:41:05,951 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1086 transitions. Word has length 369 [2023-12-25 11:41:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:41:05,951 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 1086 transitions. [2023-12-25 11:41:05,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (94), 4 states have call predecessors, (94), 6 states have return successors, (93), 7 states have call predecessors, (93), 7 states have call successors, (93) [2023-12-25 11:41:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1086 transitions. [2023-12-25 11:41:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2023-12-25 11:41:05,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:41:05,956 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:05,978 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 11:41:06,172 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 11:41:06,173 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:41:06,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:41:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1383273395, now seen corresponding path program 1 times [2023-12-25 11:41:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:41:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112018593] [2023-12-25 11:41:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:41:06,174 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 11:41:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:41:06,175 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 11:41:06,179 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 11:41:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:41:07,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:41:07,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:41:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3664 backedges. 160 proven. 12 refuted. 0 times theorem prover too weak. 3492 trivial. 0 not checked. [2023-12-25 11:41:22,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:41:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3664 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3652 trivial. 0 not checked. [2023-12-25 11:41:31,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:41:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112018593] [2023-12-25 11:41:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112018593] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:41:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:41:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-25 11:41:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248908906] [2023-12-25 11:41:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:41:31,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:41:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:41:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:41:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:41:31,270 INFO L87 Difference]: Start difference. First operand 728 states and 1086 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2023-12-25 11:41:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:41:37,058 INFO L93 Difference]: Finished difference Result 730 states and 1087 transitions. [2023-12-25 11:41:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:41:37,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 337 [2023-12-25 11:41:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:41:37,062 INFO L225 Difference]: With dead ends: 730 [2023-12-25 11:41:37,062 INFO L226 Difference]: Without dead ends: 448 [2023-12-25 11:41:37,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-25 11:41:37,064 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 284 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:41:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 901 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 11:41:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-25 11:41:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2023-12-25 11:41:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 296 states have (on average 1.364864864864865) internal successors, (404), 302 states have internal predecessors, (404), 124 states have call successors, (124), 23 states have call predecessors, (124), 27 states have return successors, (144), 122 states have call predecessors, (144), 123 states have call successors, (144) [2023-12-25 11:41:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 672 transitions. [2023-12-25 11:41:37,152 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 672 transitions. Word has length 337 [2023-12-25 11:41:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:41:37,153 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 672 transitions. [2023-12-25 11:41:37,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2023-12-25 11:41:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 672 transitions. [2023-12-25 11:41:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2023-12-25 11:41:37,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:41:37,157 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 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, 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 11:41:37,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-25 11:41:37,379 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 11:41:37,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:41:37,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:41:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -102414581, now seen corresponding path program 1 times [2023-12-25 11:41:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:41:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805296642] [2023-12-25 11:41:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:41:37,382 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 11:41:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:41:37,383 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 11:41:37,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 (17)] Waiting until timeout for monitored process [2023-12-25 11:41:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:41:39,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 1815 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:41:39,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:42:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 3 proven. 800 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2023-12-25 11:42:13,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:42:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4320 trivial. 0 not checked. [2023-12-25 11:42:21,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:42:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805296642] [2023-12-25 11:42:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805296642] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:42:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:42:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2023-12-25 11:42:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637199293] [2023-12-25 11:42:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:42:21,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 11:42:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:42:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 11:42:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 11:42:21,802 INFO L87 Difference]: Start difference. First operand 448 states and 672 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2023-12-25 11:42:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:42:25,282 INFO L93 Difference]: Finished difference Result 454 states and 677 transitions. [2023-12-25 11:42:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:42:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 369 [2023-12-25 11:42:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:42:25,285 INFO L225 Difference]: With dead ends: 454 [2023-12-25 11:42:25,285 INFO L226 Difference]: Without dead ends: 452 [2023-12-25 11:42:25,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:42:25,286 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 211 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:42:25,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 724 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 11:42:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-12-25 11:42:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2023-12-25 11:42:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 299 states have (on average 1.3612040133779264) internal successors, (407), 305 states have internal predecessors, (407), 124 states have call successors, (124), 24 states have call predecessors, (124), 28 states have return successors, (144), 122 states have call predecessors, (144), 123 states have call successors, (144) [2023-12-25 11:42:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 675 transitions. [2023-12-25 11:42:25,341 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 675 transitions. Word has length 369 [2023-12-25 11:42:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:42:25,341 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 675 transitions. [2023-12-25 11:42:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2023-12-25 11:42:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 675 transitions. [2023-12-25 11:42:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2023-12-25 11:42:25,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:42:25,345 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:25,370 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 11:42:25,560 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 11:42:25,561 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:42:25,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:42:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -730787882, now seen corresponding path program 1 times [2023-12-25 11:42:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:42:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905374611] [2023-12-25 11:42:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:42:25,562 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 11:42:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:42:25,577 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 11:42:25,605 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 11:42:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:42:27,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 1822 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:42:27,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4325 backedges. 3 proven. 802 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2023-12-25 11:43:02,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:43:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4325 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4320 trivial. 0 not checked. [2023-12-25 11:43:11,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905374611] [2023-12-25 11:43:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905374611] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 11:43:11,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 11:43:11,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2023-12-25 11:43:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543949821] [2023-12-25 11:43:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:43:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 11:43:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 11:43:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 11:43:11,219 INFO L87 Difference]: Start difference. First operand 452 states and 675 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2023-12-25 11:43:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:14,332 INFO L93 Difference]: Finished difference Result 458 states and 680 transitions. [2023-12-25 11:43:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:43:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 374 [2023-12-25 11:43:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:14,335 INFO L225 Difference]: With dead ends: 458 [2023-12-25 11:43:14,335 INFO L226 Difference]: Without dead ends: 456 [2023-12-25 11:43:14,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:43:14,336 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 203 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:14,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 727 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 11:43:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-12-25 11:43:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2023-12-25 11:43:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 302 states have (on average 1.3576158940397351) internal successors, (410), 308 states have internal predecessors, (410), 124 states have call successors, (124), 25 states have call predecessors, (124), 29 states have return successors, (144), 122 states have call predecessors, (144), 123 states have call successors, (144) [2023-12-25 11:43:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2023-12-25 11:43:14,411 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 374 [2023-12-25 11:43:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:14,412 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2023-12-25 11:43:14,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2023-12-25 11:43:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2023-12-25 11:43:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2023-12-25 11:43:14,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:14,415 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:14,435 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 11:43:14,635 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 11:43:14,635 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:14,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2089231787, now seen corresponding path program 1 times [2023-12-25 11:43:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102250766] [2023-12-25 11:43:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:14,637 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 11:43:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:14,649 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 11:43:14,680 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 11:43:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:16,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:43:16,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4331 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2023-12-25 11:43:21,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:43:21,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:21,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102250766] [2023-12-25 11:43:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102250766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:43:21,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:43:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:43:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241563995] [2023-12-25 11:43:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:43:21,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:43:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:43:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:43:21,668 INFO L87 Difference]: Start difference. First operand 456 states and 678 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (54), 3 states have call predecessors, (54), 4 states have return successors, (53), 4 states have call predecessors, (53), 3 states have call successors, (53) [2023-12-25 11:43:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:46,194 INFO L93 Difference]: Finished difference Result 1123 states and 1653 transitions. [2023-12-25 11:43:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:43:46,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (54), 3 states have call predecessors, (54), 4 states have return successors, (53), 4 states have call predecessors, (53), 3 states have call successors, (53) Word has length 379 [2023-12-25 11:43:46,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:46,198 INFO L225 Difference]: With dead ends: 1123 [2023-12-25 11:43:46,198 INFO L226 Difference]: Without dead ends: 719 [2023-12-25 11:43:46,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:43:46,199 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 461 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:46,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 666 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2023-12-25 11:43:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-12-25 11:43:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 579. [2023-12-25 11:43:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 379 states have (on average 1.2506596306068603) internal successors, (474), 383 states have internal predecessors, (474), 164 states have call successors, (164), 26 states have call predecessors, (164), 35 states have return successors, (193), 169 states have call predecessors, (193), 163 states have call successors, (193) [2023-12-25 11:43:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 831 transitions. [2023-12-25 11:43:46,357 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 831 transitions. Word has length 379 [2023-12-25 11:43:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:46,359 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 831 transitions. [2023-12-25 11:43:46,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (54), 3 states have call predecessors, (54), 4 states have return successors, (53), 4 states have call predecessors, (53), 3 states have call successors, (53) [2023-12-25 11:43:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 831 transitions. [2023-12-25 11:43:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2023-12-25 11:43:46,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:46,364 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:46,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-25 11:43:46,585 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 11:43:46,585 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:46,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1654491671, now seen corresponding path program 1 times [2023-12-25 11:43:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:46,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979379353] [2023-12-25 11:43:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:46,587 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 11:43:46,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:46,588 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 11:43:46,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 (20)] Waiting until timeout for monitored process [2023-12-25 11:43:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:50,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:43:50,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:52,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-25 11:43:52,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-12-25 11:43:53,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-25 11:43:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4331 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2023-12-25 11:43:53,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:43:53,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:53,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979379353] [2023-12-25 11:43:53,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979379353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:43:53,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:43:53,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:43:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388576052] [2023-12-25 11:43:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:43:53,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:43:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:43:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:43:53,913 INFO L87 Difference]: Start difference. First operand 579 states and 831 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (53), 4 states have call predecessors, (53), 4 states have call successors, (53) [2023-12-25 11:43:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:02,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:06,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:44:16,425 INFO L93 Difference]: Finished difference Result 790 states and 1110 transitions. [2023-12-25 11:44:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:44:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (53), 4 states have call predecessors, (53), 4 states have call successors, (53) Word has length 379 [2023-12-25 11:44:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:44:16,428 INFO L225 Difference]: With dead ends: 790 [2023-12-25 11:44:16,428 INFO L226 Difference]: Without dead ends: 548 [2023-12-25 11:44:16,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:44:16,429 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 142 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 109 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:44:16,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 686 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 295 Invalid, 3 Unknown, 0 Unchecked, 21.9s Time] [2023-12-25 11:44:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-12-25 11:44:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 541. [2023-12-25 11:44:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 352 states have (on average 1.2329545454545454) internal successors, (434), 355 states have internal predecessors, (434), 155 states have call successors, (155), 26 states have call predecessors, (155), 33 states have return successors, (181), 159 states have call predecessors, (181), 154 states have call successors, (181) [2023-12-25 11:44:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 770 transitions. [2023-12-25 11:44:16,509 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 770 transitions. Word has length 379 [2023-12-25 11:44:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:44:16,509 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 770 transitions. [2023-12-25 11:44:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (53), 4 states have call predecessors, (53), 4 states have call successors, (53) [2023-12-25 11:44:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 770 transitions. [2023-12-25 11:44:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2023-12-25 11:44:16,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:44:16,514 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:16,542 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 (20)] Ended with exit code 0 [2023-12-25 11:44:16,728 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 11:44:16,729 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:44:16,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:44:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 151397321, now seen corresponding path program 1 times [2023-12-25 11:44:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:44:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197599988] [2023-12-25 11:44:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:44:16,730 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 11:44:16,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:44:16,732 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 11:44:16,733 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 11:44:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:44:18,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 11:44:18,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:44:24,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:44:29,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-25 11:44:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4331 backedges. 850 proven. 3 refuted. 0 times theorem prover too weak. 3478 trivial. 0 not checked. [2023-12-25 11:44:29,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:44:31,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:44:31,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:44:34,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:44:34,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:44:34,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-25 11:44:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-12-25 11:44:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4331 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4320 trivial. 0 not checked. [2023-12-25 11:44:38,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:44:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197599988] [2023-12-25 11:44:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197599988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:44:38,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:44:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-25 11:44:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059845081] [2023-12-25 11:44:38,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:44:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 11:44:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:44:38,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 11:44:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-12-25 11:44:38,204 INFO L87 Difference]: Start difference. First operand 541 states and 770 transitions. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 12 states have call successors, (104), 7 states have call predecessors, (104), 12 states have return successors, (103), 14 states have call predecessors, (103), 12 states have call successors, (103) [2023-12-25 11:44:44,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:48,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:52,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:56,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:00,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:04,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:08,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:12,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:17,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:21,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:25,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:29,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:40,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:46:24,973 INFO L93 Difference]: Finished difference Result 1153 states and 1661 transitions. [2023-12-25 11:46:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 11:46:24,974 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 12 states have call successors, (104), 7 states have call predecessors, (104), 12 states have return successors, (103), 14 states have call predecessors, (103), 12 states have call successors, (103) Word has length 379 [2023-12-25 11:46:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:46:24,978 INFO L225 Difference]: With dead ends: 1153 [2023-12-25 11:46:24,978 INFO L226 Difference]: Without dead ends: 931 [2023-12-25 11:46:24,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 743 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-12-25 11:46:24,979 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 928 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1008 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1008 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:46:24,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1856 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1008 Valid, 2015 Invalid, 12 Unknown, 0 Unchecked, 101.2s Time] [2023-12-25 11:46:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-12-25 11:46:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 779. [2023-12-25 11:46:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 498 states have (on average 1.2469879518072289) internal successors, (621), 507 states have internal predecessors, (621), 230 states have call successors, (230), 34 states have call predecessors, (230), 50 states have return successors, (280), 237 states have call predecessors, (280), 229 states have call successors, (280) [2023-12-25 11:46:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1131 transitions. [2023-12-25 11:46:25,112 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1131 transitions. Word has length 379 [2023-12-25 11:46:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:46:25,112 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1131 transitions. [2023-12-25 11:46:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 12 states have call successors, (104), 7 states have call predecessors, (104), 12 states have return successors, (103), 14 states have call predecessors, (103), 12 states have call successors, (103) [2023-12-25 11:46:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1131 transitions. [2023-12-25 11:46:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2023-12-25 11:46:25,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:46:25,116 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 18, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:25,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-25 11:46:25,333 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 11:46:25,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:46:25,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:46:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 409013208, now seen corresponding path program 1 times [2023-12-25 11:46:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:46:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787721723] [2023-12-25 11:46:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:46:25,335 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 11:46:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:46:25,336 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 11:46:25,337 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 11:46:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:46:29,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:46:29,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:46:31,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-25 11:46:31,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-12-25 11:46:31,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-25 11:46:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 4328 trivial. 0 not checked. [2023-12-25 11:46:31,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:46:31,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:46:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787721723] [2023-12-25 11:46:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787721723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:46:31,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:46:31,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:46:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034605513] [2023-12-25 11:46:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:46:31,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 11:46:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:46:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 11:46:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:46:31,948 INFO L87 Difference]: Start difference. First operand 779 states and 1131 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) [2023-12-25 11:46:36,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:40,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:44,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:46:54,081 INFO L93 Difference]: Finished difference Result 1351 states and 1933 transitions. [2023-12-25 11:46:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 11:46:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) Word has length 398 [2023-12-25 11:46:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:46:54,085 INFO L225 Difference]: With dead ends: 1351 [2023-12-25 11:46:54,085 INFO L226 Difference]: Without dead ends: 795 [2023-12-25 11:46:54,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:46:54,087 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 79 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 75 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:46:54,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 690 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 290 Invalid, 3 Unknown, 0 Unchecked, 21.6s Time] [2023-12-25 11:46:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2023-12-25 11:46:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 771. [2023-12-25 11:46:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 492 states have (on average 1.2479674796747968) internal successors, (614), 500 states have internal predecessors, (614), 229 states have call successors, (229), 34 states have call predecessors, (229), 49 states have return successors, (275), 236 states have call predecessors, (275), 228 states have call successors, (275) [2023-12-25 11:46:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1118 transitions. [2023-12-25 11:46:54,261 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1118 transitions. Word has length 398 [2023-12-25 11:46:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:46:54,261 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1118 transitions. [2023-12-25 11:46:54,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (55), 4 states have call predecessors, (55), 4 states have call successors, (55) [2023-12-25 11:46:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1118 transitions. [2023-12-25 11:46:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2023-12-25 11:46:54,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:46:54,266 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 6, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:54,309 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 11:46:54,492 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 11:46:54,492 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:46:54,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:46:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 610737384, now seen corresponding path program 1 times [2023-12-25 11:46:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:46:54,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712843791] [2023-12-25 11:46:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:46:54,494 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 11:46:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:46:54,496 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 11:46:54,530 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 11:46:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:46:59,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 11:46:59,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:47:02,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:47:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2023-12-25 11:47:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:47:05,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2023-12-25 11:47:09,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-25 11:47:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4328 backedges. 702 proven. 18 refuted. 0 times theorem prover too weak. 3608 trivial. 0 not checked. [2023-12-25 11:47:09,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:47:12,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-12-25 11:47:12,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-12-25 11:47:15,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:47:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712843791] [2023-12-25 11:47:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712843791] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:47:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124998152] [2023-12-25 11:47:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:47:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 11:47:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 11:47:15,705 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 11:47:15,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-25 11:47:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:47:19,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 11:47:19,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:47:22,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 11:47:24,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2023-12-25 11:47:25,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:47:25,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2023-12-25 11:47:28,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-25 11:47:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4328 backedges. 702 proven. 18 refuted. 0 times theorem prover too weak. 3608 trivial. 0 not checked. [2023-12-25 11:47:28,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:47:30,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-12-25 11:47:30,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2023-12-25 11:47:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2124998152] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:47:33,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:47:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-12-25 11:47:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226782369] [2023-12-25 11:47:33,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:47:33,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:47:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:47:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:47:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-25 11:47:33,131 INFO L87 Difference]: Start difference. First operand 771 states and 1118 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 8 states have call successors, (56), 6 states have call predecessors, (56), 7 states have return successors, (55), 8 states have call predecessors, (55), 8 states have call successors, (55) [2023-12-25 11:47:39,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:43,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:47,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:51,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:55,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:59,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:03,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:07,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:11,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:48:43,411 INFO L93 Difference]: Finished difference Result 1296 states and 1865 transitions. [2023-12-25 11:48:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:48:43,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 8 states have call successors, (56), 6 states have call predecessors, (56), 7 states have return successors, (55), 8 states have call predecessors, (55), 8 states have call successors, (55) Word has length 380 [2023-12-25 11:48:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:48:43,417 INFO L225 Difference]: With dead ends: 1296 [2023-12-25 11:48:43,418 INFO L226 Difference]: Without dead ends: 801 [2023-12-25 11:48:43,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1355 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2023-12-25 11:48:43,421 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 592 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 655 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:48:43,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1004 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 1041 Invalid, 9 Unknown, 0 Unchecked, 67.3s Time] [2023-12-25 11:48:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2023-12-25 11:48:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 771. [2023-12-25 11:48:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 492 states have (on average 1.241869918699187) internal successors, (611), 500 states have internal predecessors, (611), 229 states have call successors, (229), 34 states have call predecessors, (229), 49 states have return successors, (275), 236 states have call predecessors, (275), 228 states have call successors, (275) [2023-12-25 11:48:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1115 transitions. [2023-12-25 11:48:43,595 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1115 transitions. Word has length 380 [2023-12-25 11:48:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:48:43,595 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1115 transitions. [2023-12-25 11:48:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 8 states have call successors, (56), 6 states have call predecessors, (56), 7 states have return successors, (55), 8 states have call predecessors, (55), 8 states have call successors, (55) [2023-12-25 11:48:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1115 transitions. [2023-12-25 11:48:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2023-12-25 11:48:43,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:48:43,600 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 47, 18, 7, 7, 7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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 11:48:43,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-12-25 11:48:43,851 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 11:48:44,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 11:48:44,017 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:48:44,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:48:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -604562063, now seen corresponding path program 1 times [2023-12-25 11:48:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:48:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675122597] [2023-12-25 11:48:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:48:44,018 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 11:48:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:48:44,020 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 11:48:44,026 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 11:48:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:48:47,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 11:48:47,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:48:47,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-25 11:48:50,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-25 11:48:50,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 11:48:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 610 proven. 15 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-12-25 11:48:50,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:48:51,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-25 11:48:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-25 11:48:55,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-25 11:48:56,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-25 11:48:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2023-12-25 11:48:58,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:48:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675122597] [2023-12-25 11:48:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675122597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:48:58,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:48:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-25 11:48:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701333424] [2023-12-25 11:48:58,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:48:58,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:48:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:48:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:48:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:48:58,335 INFO L87 Difference]: Start difference. First operand 771 states and 1115 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 15 states have internal predecessors, (142), 11 states have call successors, (113), 6 states have call predecessors, (113), 8 states have return successors, (112), 10 states have call predecessors, (112), 11 states have call successors, (112) [2023-12-25 11:49:04,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:08,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:12,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:16,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 11:49:17,373 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 (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:49:17,373 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 11:49:18,419 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 11:49:18,573 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 11:49:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 809 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-12-25 11:49:18,615 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:49:18,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 18.0s Time] [2023-12-25 11:49:18,616 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:49:18,617 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 11:49:18,620 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:49:18,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 11:49:18,624 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:49:18,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:49:18 BoogieIcfgContainer [2023-12-25 11:49:18,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:49:18,625 INFO L158 Benchmark]: Toolchain (without parser) took 868437.28ms. Allocated memory was 196.1MB in the beginning and 316.7MB in the end (delta: 120.6MB). Free memory was 132.8MB in the beginning and 227.3MB in the end (delta: -94.4MB). Peak memory consumption was 194.2MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,625 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 196.1MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:49:18,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.45ms. Allocated memory was 196.1MB in the beginning and 239.1MB in the end (delta: 43.0MB). Free memory was 132.6MB in the beginning and 193.5MB in the end (delta: -60.9MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.83ms. Allocated memory is still 239.1MB. Free memory was 193.5MB in the beginning and 187.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,626 INFO L158 Benchmark]: Boogie Preprocessor took 126.53ms. Allocated memory is still 239.1MB. Free memory was 187.8MB in the beginning and 176.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,626 INFO L158 Benchmark]: RCFGBuilder took 6016.66ms. Allocated memory is still 239.1MB. Free memory was 176.7MB in the beginning and 162.1MB in the end (delta: 14.6MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,626 INFO L158 Benchmark]: TraceAbstraction took 861604.40ms. Allocated memory was 239.1MB in the beginning and 316.7MB in the end (delta: 77.6MB). Free memory was 161.0MB in the beginning and 227.3MB in the end (delta: -66.2MB). Peak memory consumption was 179.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:18,627 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.17ms. Allocated memory is still 196.1MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 588.45ms. Allocated memory was 196.1MB in the beginning and 239.1MB in the end (delta: 43.0MB). Free memory was 132.6MB in the beginning and 193.5MB in the end (delta: -60.9MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.83ms. Allocated memory is still 239.1MB. Free memory was 193.5MB in the beginning and 187.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 126.53ms. Allocated memory is still 239.1MB. Free memory was 187.8MB in the beginning and 176.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * RCFGBuilder took 6016.66ms. Allocated memory is still 239.1MB. Free memory was 176.7MB in the beginning and 162.1MB in the end (delta: 14.6MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. * TraceAbstraction took 861604.40ms. Allocated memory was 239.1MB in the beginning and 316.7MB in the end (delta: 77.6MB). Free memory was 161.0MB in the beginning and 227.3MB in the end (delta: -66.2MB). Peak memory consumption was 179.1MB. 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: 539]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 539). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 173 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 861.5s, OverallIterations: 23, TraceHistogramMax: 47, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 429.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 5894 SdHoareTripleChecker+Valid, 405.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5394 mSDsluCounter, 19521 SdHoareTripleChecker+Invalid, 398.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13992 mSDsCounter, 3728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7344 IncrementalHoareTripleChecker+Invalid, 11122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3728 mSolverCounterUnsat, 5529 mSDtfsCounter, 7344 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13321 GetRequests, 13085 SyntacticMatches, 6 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 57.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=20, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 792 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.5s SsaConstructionTime, 25.6s SatisfiabilityAnalysisTime, 383.5s InterpolantComputationTime, 7980 NumberOfCodeBlocks, 7171 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 12629 ConstructedInterpolants, 0 QuantifiedInterpolants, 39617 SizeOfPredicates, 63 NumberOfNonLiveVariables, 33520 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 38 InterpolantComputations, 16 PerfectInterpolantSequences, 143516/145491 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