/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:22:12,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:22:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 05:22:13,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:22:13,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:22:13,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:22:13,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:22:13,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:22:13,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:22:13,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:22:13,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:22:13,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:22:13,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:22:13,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:22:13,106 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:22:13,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:22:13,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:22:13,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:22:13,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:22:13,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:22:13,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:22:13,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:22:13,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:22:13,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:22:13,114 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:22:13,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:22:13,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:22:13,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:22:13,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:22:13,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:22:13,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:22:13,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:13,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:22:13,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:22:13,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:22:13,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:22:13,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:22:13,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:22:13,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:22:13,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:22:13,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:22:13,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:22:13,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:22:13,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:22:13,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:22:13,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:22:13,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:22:13,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i [2024-11-06 05:22:15,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:22:15,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:22:15,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i [2024-11-06 05:22:15,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0ea0af5/bb62dbb34201405f85daff23dbf1d7c4/FLAG929e2fe42 [2024-11-06 05:22:15,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0ea0af5/bb62dbb34201405f85daff23dbf1d7c4 [2024-11-06 05:22:15,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:22:15,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:22:15,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:15,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:22:15,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:22:15,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:15" (1/1) ... [2024-11-06 05:22:15,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b673def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:15, skipping insertion in model container [2024-11-06 05:22:15,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:15" (1/1) ... [2024-11-06 05:22:15,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:15,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2024-11-06 05:22:15,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2024-11-06 05:22:16,905 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,081 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,106 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,107 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,108 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,109 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,110 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,117 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,130 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,131 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,131 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,132 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,133 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,134 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,135 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,136 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,138 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,138 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,139 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,142 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,517 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:17,685 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 05:22:17,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:17,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2024-11-06 05:22:17,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2024-11-06 05:22:17,759 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,784 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,788 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,790 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,793 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,793 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,794 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,795 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,798 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,799 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,799 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,800 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,800 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,801 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,801 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,801 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,802 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,803 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,803 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,807 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,807 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,807 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,860 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,860 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,861 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,861 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,898 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:17,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:17,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:22:17,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2024-11-06 05:22:17,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2024-11-06 05:22:17,982 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,982 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,982 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,984 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,984 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,991 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,991 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,992 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,992 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,995 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,996 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,996 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:17,996 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:18,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:18,364 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 05:22:18,375 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:22:18,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18 WrapperNode [2024-11-06 05:22:18,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:18,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:18,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:22:18,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:22:18,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,574 INFO L138 Inliner]: procedures = 687, calls = 1043, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 136 [2024-11-06 05:22:18,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:18,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:22:18,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:22:18,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:22:18,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,632 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-06 05:22:18,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:22:18,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:22:18,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:22:18,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:22:18,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (1/1) ... [2024-11-06 05:22:18,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:22:18,739 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) [2024-11-06 05:22:18,741 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 [2024-11-06 05:22:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:22:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:22:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:22:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:22:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 05:22:18,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 05:22:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:18,771 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-06 05:22:18,772 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 05:22:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2024-11-06 05:22:18,773 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2024-11-06 05:22:18,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:22:18,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:22:18,773 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-06 05:22:18,773 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-06 05:22:18,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:22:18,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:22:18,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:22:18,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 05:22:18,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 05:22:18,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 05:22:18,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 05:22:18,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 05:22:18,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 05:22:18,775 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-06 05:22:18,775 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-06 05:22:18,775 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:22:18,775 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:22:19,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:22:19,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:22:19,526 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-06 05:22:19,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:22:19,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:22:19,549 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 05:22:19,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:19 BoogieIcfgContainer [2024-11-06 05:22:19,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:22:19,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:22:19,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:22:19,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:22:19,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:22:15" (1/3) ... [2024-11-06 05:22:19,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5375f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:19, skipping insertion in model container [2024-11-06 05:22:19,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:18" (2/3) ... [2024-11-06 05:22:19,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5375f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:19, skipping insertion in model container [2024-11-06 05:22:19,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:19" (3/3) ... [2024-11-06 05:22:19,562 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2024-11-06 05:22:19,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:22:19,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:22:19,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:22:19,653 INFO L333 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, 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;@38ac1728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:22:19,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:22:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-06 05:22:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:22:19,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:19,670 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:19,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1606468667, now seen corresponding path program 1 times [2024-11-06 05:22:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325280186] [2024-11-06 05:22:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:19,692 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 [2024-11-06 05:22:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:19,693 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) [2024-11-06 05:22:19,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 05:22:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:19,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:22:19,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-06 05:22:20,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:20,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325280186] [2024-11-06 05:22:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325280186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:22:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818035415] [2024-11-06 05:22:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:20,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:22:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:20,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:22:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:22:20,056 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-06 05:22:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:20,101 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-11-06 05:22:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:22:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-11-06 05:22:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:20,113 INFO L225 Difference]: With dead ends: 188 [2024-11-06 05:22:20,114 INFO L226 Difference]: Without dead ends: 93 [2024-11-06 05:22:20,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:22:20,122 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:20,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-06 05:22:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-06 05:22:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 05:22:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-11-06 05:22:20,178 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2024-11-06 05:22:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:20,179 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-11-06 05:22:20,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-06 05:22:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-11-06 05:22:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 05:22:20,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:20,190 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:20,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 05:22:20,391 WARN L453 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 [2024-11-06 05:22:20,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1607570691, now seen corresponding path program 1 times [2024-11-06 05:22:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414719466] [2024-11-06 05:22:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:20,394 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 [2024-11-06 05:22:20,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:20,398 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) [2024-11-06 05:22:20,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 05:22:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:20,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 05:22:20,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 05:22:20,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:20,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414719466] [2024-11-06 05:22:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414719466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 05:22:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985359246] [2024-11-06 05:22:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:22:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:22:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:22:20,815 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-06 05:22:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:20,922 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2024-11-06 05:22:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:22:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2024-11-06 05:22:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:20,930 INFO L225 Difference]: With dead ends: 169 [2024-11-06 05:22:20,931 INFO L226 Difference]: Without dead ends: 95 [2024-11-06 05:22:20,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:22:20,933 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:20,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-06 05:22:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-06 05:22:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-06 05:22:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-11-06 05:22:20,954 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2024-11-06 05:22:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:20,955 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-11-06 05:22:20,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-06 05:22:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-06 05:22:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-06 05:22:20,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:20,961 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:20,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 05:22:21,162 WARN L453 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 [2024-11-06 05:22:21,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:21,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -254868999, now seen corresponding path program 1 times [2024-11-06 05:22:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233022863] [2024-11-06 05:22:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:21,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:21,166 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) [2024-11-06 05:22:21,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 05:22:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:21,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 05:22:21,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 05:22:21,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:21,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233022863] [2024-11-06 05:22:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233022863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:22:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100429556] [2024-11-06 05:22:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:22:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:22:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:21,560 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:21,808 INFO L93 Difference]: Finished difference Result 176 states and 233 transitions. [2024-11-06 05:22:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:22:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2024-11-06 05:22:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:21,814 INFO L225 Difference]: With dead ends: 176 [2024-11-06 05:22:21,814 INFO L226 Difference]: Without dead ends: 97 [2024-11-06 05:22:21,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:21,819 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:21,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 681 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 05:22:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-06 05:22:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-06 05:22:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-06 05:22:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2024-11-06 05:22:21,843 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2024-11-06 05:22:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2024-11-06 05:22:21,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2024-11-06 05:22:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-06 05:22:21,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:21,848 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:21,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 05:22:22,049 WARN L453 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 [2024-11-06 05:22:22,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2045206106, now seen corresponding path program 1 times [2024-11-06 05:22:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332086713] [2024-11-06 05:22:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:22,052 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 [2024-11-06 05:22:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:22,059 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) [2024-11-06 05:22:22,061 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 [2024-11-06 05:22:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:22,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 05:22:22,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 05:22:22,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:22,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332086713] [2024-11-06 05:22:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332086713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:22,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 05:22:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98556640] [2024-11-06 05:22:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:22,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 05:22:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 05:22:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:22,443 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:22,726 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2024-11-06 05:22:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:22:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2024-11-06 05:22:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:22,729 INFO L225 Difference]: With dead ends: 182 [2024-11-06 05:22:22,730 INFO L226 Difference]: Without dead ends: 102 [2024-11-06 05:22:22,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:22:22,731 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:22,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 765 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 05:22:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-06 05:22:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-06 05:22:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-06 05:22:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2024-11-06 05:22:22,756 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2024-11-06 05:22:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2024-11-06 05:22:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-06 05:22:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-06 05:22:22,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:22,761 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:22,778 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 [2024-11-06 05:22:22,962 WARN L453 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 [2024-11-06 05:22:22,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash -708361508, now seen corresponding path program 1 times [2024-11-06 05:22:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727091217] [2024-11-06 05:22:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:22:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:22,965 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) [2024-11-06 05:22:22,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 05:22:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:23,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 05:22:23,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 05:22:23,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:23,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727091217] [2024-11-06 05:22:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727091217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:23,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:22:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561818694] [2024-11-06 05:22:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:23,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:22:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:22:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:23,334 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:23,493 INFO L93 Difference]: Finished difference Result 179 states and 238 transitions. [2024-11-06 05:22:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:22:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2024-11-06 05:22:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:23,498 INFO L225 Difference]: With dead ends: 179 [2024-11-06 05:22:23,498 INFO L226 Difference]: Without dead ends: 102 [2024-11-06 05:22:23,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:22:23,500 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 36 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:23,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 561 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-06 05:22:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-06 05:22:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-06 05:22:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2024-11-06 05:22:23,523 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2024-11-06 05:22:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:23,523 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2024-11-06 05:22:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 05:22:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2024-11-06 05:22:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-06 05:22:23,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:23,525 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:23,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 05:22:23,725 WARN L453 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 [2024-11-06 05:22:23,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:23,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1326114882, now seen corresponding path program 1 times [2024-11-06 05:22:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:23,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801644485] [2024-11-06 05:22:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:23,727 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 [2024-11-06 05:22:23,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:23,730 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) [2024-11-06 05:22:23,731 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 [2024-11-06 05:22:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:23,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:22:23,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 05:22:24,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:24,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801644485] [2024-11-06 05:22:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801644485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:24,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:22:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387066846] [2024-11-06 05:22:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:24,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:22:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:22:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:22:24,008 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 05:22:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:24,082 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2024-11-06 05:22:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:22:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-11-06 05:22:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:24,085 INFO L225 Difference]: With dead ends: 178 [2024-11-06 05:22:24,085 INFO L226 Difference]: Without dead ends: 100 [2024-11-06 05:22:24,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:22:24,086 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:24,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-06 05:22:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-06 05:22:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-06 05:22:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-11-06 05:22:24,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2024-11-06 05:22:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:24,101 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-11-06 05:22:24,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 05:22:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-11-06 05:22:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:24,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:24,105 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:24,117 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 [2024-11-06 05:22:24,309 WARN L453 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 [2024-11-06 05:22:24,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash -720348629, now seen corresponding path program 1 times [2024-11-06 05:22:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524926587] [2024-11-06 05:22:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:24,311 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 [2024-11-06 05:22:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:24,313 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) [2024-11-06 05:22:24,314 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 [2024-11-06 05:22:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:24,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 05:22:24,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 05:22:25,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:25,507 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-06 05:22:25,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-11-06 05:22:25,529 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-06 05:22:25,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2024-11-06 05:22:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-06 05:22:25,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524926587] [2024-11-06 05:22:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524926587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:25,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-11-06 05:22:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427297951] [2024-11-06 05:22:25,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 05:22:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 05:22:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:22:25,581 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-06 05:22:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:26,783 INFO L93 Difference]: Finished difference Result 202 states and 274 transitions. [2024-11-06 05:22:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 05:22:26,783 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 99 [2024-11-06 05:22:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:26,786 INFO L225 Difference]: With dead ends: 202 [2024-11-06 05:22:26,786 INFO L226 Difference]: Without dead ends: 123 [2024-11-06 05:22:26,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-11-06 05:22:26,787 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 54 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:26,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1144 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 05:22:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-06 05:22:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2024-11-06 05:22:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-06 05:22:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2024-11-06 05:22:26,807 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 99 [2024-11-06 05:22:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:26,810 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2024-11-06 05:22:26,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 13 states have internal predecessors, (79), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-06 05:22:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2024-11-06 05:22:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:26,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:26,812 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:26,821 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 [2024-11-06 05:22:27,012 WARN L453 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 [2024-11-06 05:22:27,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:27,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1218813417, now seen corresponding path program 1 times [2024-11-06 05:22:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365976980] [2024-11-06 05:22:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:27,014 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 [2024-11-06 05:22:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:27,015 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) [2024-11-06 05:22:27,016 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 [2024-11-06 05:22:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:27,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 05:22:27,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:31,617 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|))))) is different from true [2024-11-06 05:22:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 05:22:32,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:32,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365976980] [2024-11-06 05:22:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365976980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-06 05:22:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963375026] [2024-11-06 05:22:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:32,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 05:22:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 05:22:32,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2024-11-06 05:22:32,202 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 05:22:37,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 05:22:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:38,076 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2024-11-06 05:22:38,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 05:22:38,077 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-11-06 05:22:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:38,078 INFO L225 Difference]: With dead ends: 227 [2024-11-06 05:22:38,078 INFO L226 Difference]: Without dead ends: 140 [2024-11-06 05:22:38,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2024-11-06 05:22:38,079 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:38,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 758 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 1 Unknown, 179 Unchecked, 5.6s Time] [2024-11-06 05:22:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-06 05:22:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2024-11-06 05:22:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.244186046511628) internal successors, (107), 89 states have internal predecessors, (107), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-06 05:22:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2024-11-06 05:22:38,093 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 99 [2024-11-06 05:22:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2024-11-06 05:22:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 05:22:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2024-11-06 05:22:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:38,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:38,095 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:38,106 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 (9)] Ended with exit code 0 [2024-11-06 05:22:38,295 WARN L453 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 [2024-11-06 05:22:38,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 737733159, now seen corresponding path program 1 times [2024-11-06 05:22:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:38,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107584138] [2024-11-06 05:22:38,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:38,298 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 [2024-11-06 05:22:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:38,299 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) [2024-11-06 05:22:38,300 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 [2024-11-06 05:22:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:38,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 05:22:38,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 05:22:38,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-06 05:22:38,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107584138] [2024-11-06 05:22:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107584138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:38,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:38,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-11-06 05:22:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980350742] [2024-11-06 05:22:38,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:38,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 05:22:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:38,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 05:22:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:22:38,918 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-06 05:22:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:39,313 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2024-11-06 05:22:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:22:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 99 [2024-11-06 05:22:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:39,317 INFO L225 Difference]: With dead ends: 261 [2024-11-06 05:22:39,317 INFO L226 Difference]: Without dead ends: 134 [2024-11-06 05:22:39,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-06 05:22:39,318 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 49 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:39,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1109 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 05:22:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-06 05:22:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2024-11-06 05:22:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 26 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (37), 24 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-06 05:22:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2024-11-06 05:22:39,341 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 99 [2024-11-06 05:22:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:39,341 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2024-11-06 05:22:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-06 05:22:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2024-11-06 05:22:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:39,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:39,342 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:39,356 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 (10)] Ended with exit code 0 [2024-11-06 05:22:39,543 WARN L453 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 [2024-11-06 05:22:39,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1114579221, now seen corresponding path program 1 times [2024-11-06 05:22:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951391932] [2024-11-06 05:22:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:39,545 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 [2024-11-06 05:22:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:39,548 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) [2024-11-06 05:22:39,549 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 [2024-11-06 05:22:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:39,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:22:39,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 05:22:39,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:39,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951391932] [2024-11-06 05:22:39,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951391932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:39,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 05:22:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705614472] [2024-11-06 05:22:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:39,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 05:22:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 05:22:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:22:39,745 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 05:22:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:39,773 INFO L93 Difference]: Finished difference Result 239 states and 328 transitions. [2024-11-06 05:22:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 05:22:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-06 05:22:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:39,775 INFO L225 Difference]: With dead ends: 239 [2024-11-06 05:22:39,775 INFO L226 Difference]: Without dead ends: 131 [2024-11-06 05:22:39,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 05:22:39,777 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:39,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-06 05:22:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-06 05:22:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 95 states have internal predecessors, (110), 26 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (37), 24 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-06 05:22:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2024-11-06 05:22:39,793 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 99 [2024-11-06 05:22:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2024-11-06 05:22:39,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 05:22:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2024-11-06 05:22:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:39,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:39,796 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:39,807 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 [2024-11-06 05:22:39,997 WARN L453 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 [2024-11-06 05:22:39,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:39,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -553879443, now seen corresponding path program 1 times [2024-11-06 05:22:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413499076] [2024-11-06 05:22:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:39,998 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 [2024-11-06 05:22:39,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:40,002 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) [2024-11-06 05:22:40,003 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 [2024-11-06 05:22:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:40,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 05:22:40,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 05:22:40,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:40,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413499076] [2024-11-06 05:22:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413499076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:40,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:22:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341822574] [2024-11-06 05:22:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:40,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:22:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:22:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:22:40,185 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 05:22:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:40,236 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2024-11-06 05:22:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:22:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-06 05:22:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:40,238 INFO L225 Difference]: With dead ends: 245 [2024-11-06 05:22:40,238 INFO L226 Difference]: Without dead ends: 135 [2024-11-06 05:22:40,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:22:40,240 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:40,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-06 05:22:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-06 05:22:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 98 states have internal predecessors, (113), 26 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (37), 24 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-06 05:22:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-11-06 05:22:40,257 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 99 [2024-11-06 05:22:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:40,258 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-11-06 05:22:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-06 05:22:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-11-06 05:22:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 05:22:40,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:40,259 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:40,280 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 (12)] Ended with exit code 0 [2024-11-06 05:22:40,460 WARN L453 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 [2024-11-06 05:22:40,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash 801416811, now seen corresponding path program 1 times [2024-11-06 05:22:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:40,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538274016] [2024-11-06 05:22:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:40,462 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 [2024-11-06 05:22:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:40,465 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) [2024-11-06 05:22:40,467 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 [2024-11-06 05:22:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:40,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:22:40,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 05:22:40,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:40,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538274016] [2024-11-06 05:22:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538274016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 05:22:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682668800] [2024-11-06 05:22:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 05:22:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 05:22:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:22:40,737 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-06 05:22:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:40,841 INFO L93 Difference]: Finished difference Result 263 states and 357 transitions. [2024-11-06 05:22:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:22:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 99 [2024-11-06 05:22:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:40,844 INFO L225 Difference]: With dead ends: 263 [2024-11-06 05:22:40,844 INFO L226 Difference]: Without dead ends: 121 [2024-11-06 05:22:40,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:22:40,845 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 31 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:22:40,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 600 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:22:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-06 05:22:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-06 05:22:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-06 05:22:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2024-11-06 05:22:40,860 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 99 [2024-11-06 05:22:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:40,860 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2024-11-06 05:22:40,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-06 05:22:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2024-11-06 05:22:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 05:22:40,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:40,862 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:40,871 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 [2024-11-06 05:22:41,062 WARN L453 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 [2024-11-06 05:22:41,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1707514615, now seen corresponding path program 1 times [2024-11-06 05:22:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688505387] [2024-11-06 05:22:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:41,064 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 [2024-11-06 05:22:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:41,065 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) [2024-11-06 05:22:41,066 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 [2024-11-06 05:22:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:41,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-06 05:22:41,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:45,659 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (_ bv0 64))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (_ bv0 64)) v_aws_linked_list_front_~list.base_BEFORE_CALL_7)))) is different from true [2024-11-06 05:22:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 05:22:46,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:22:52,605 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-06 05:22:52,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2024-11-06 05:22:52,621 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-06 05:22:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2024-11-06 05:22:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 05:22:52,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688505387] [2024-11-06 05:22:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688505387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:22:52,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:22:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2024-11-06 05:22:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124043133] [2024-11-06 05:22:52,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:22:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-06 05:22:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-06 05:22:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2024-11-06 05:22:52,639 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-06 05:22:59,553 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 [0] [2024-11-06 05:23:04,551 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 [0] [2024-11-06 05:23:08,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 05:23:12,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 05:23:16,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 05:23:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:17,498 INFO L93 Difference]: Finished difference Result 280 states and 367 transitions. [2024-11-06 05:23:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-06 05:23:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 100 [2024-11-06 05:23:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:17,501 INFO L225 Difference]: With dead ends: 280 [2024-11-06 05:23:17,501 INFO L226 Difference]: Without dead ends: 163 [2024-11-06 05:23:17,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=128, Invalid=996, Unknown=2, NotChecked=64, Total=1190 [2024-11-06 05:23:17,502 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 45 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:17,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1374 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1268 Invalid, 5 Unknown, 389 Unchecked, 24.0s Time] [2024-11-06 05:23:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-06 05:23:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2024-11-06 05:23:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 110 states have internal predecessors, (128), 27 states have call successors, (27), 11 states have call predecessors, (27), 12 states have return successors, (36), 28 states have call predecessors, (36), 26 states have call successors, (36) [2024-11-06 05:23:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 191 transitions. [2024-11-06 05:23:17,523 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 191 transitions. Word has length 100 [2024-11-06 05:23:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:17,523 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 191 transitions. [2024-11-06 05:23:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-06 05:23:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 191 transitions. [2024-11-06 05:23:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-06 05:23:17,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:17,525 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:17,537 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 [2024-11-06 05:23:17,725 WARN L453 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 [2024-11-06 05:23:17,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:17,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2004209732, now seen corresponding path program 1 times [2024-11-06 05:23:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487134774] [2024-11-06 05:23:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:17,726 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 [2024-11-06 05:23:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:17,728 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) [2024-11-06 05:23:17,729 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 [2024-11-06 05:23:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:17,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 05:23:17,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-06 05:23:17,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:17,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487134774] [2024-11-06 05:23:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487134774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:23:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032771769] [2024-11-06 05:23:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:23:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:23:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:17,969 INFO L87 Difference]: Start difference. First operand 150 states and 191 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-06 05:23:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:18,001 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2024-11-06 05:23:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:23:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-06 05:23:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:18,003 INFO L225 Difference]: With dead ends: 256 [2024-11-06 05:23:18,003 INFO L226 Difference]: Without dead ends: 147 [2024-11-06 05:23:18,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:18,004 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:18,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:23:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-06 05:23:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-06 05:23:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 108 states have internal predecessors, (122), 27 states have call successors, (27), 11 states have call predecessors, (27), 12 states have return successors, (35), 27 states have call predecessors, (35), 26 states have call successors, (35) [2024-11-06 05:23:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2024-11-06 05:23:18,024 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 110 [2024-11-06 05:23:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:18,024 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2024-11-06 05:23:18,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-06 05:23:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2024-11-06 05:23:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 05:23:18,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:18,025 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:18,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-06 05:23:18,229 WARN L453 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 [2024-11-06 05:23:18,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 284996604, now seen corresponding path program 2 times [2024-11-06 05:23:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148887174] [2024-11-06 05:23:18,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:23:18,231 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 [2024-11-06 05:23:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:18,232 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) [2024-11-06 05:23:18,233 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 [2024-11-06 05:23:18,431 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:23:18,432 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:23:18,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-06 05:23:18,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-06 05:23:19,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:21,431 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-06 05:23:21,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-06 05:23:21,442 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-06 05:23:21,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-06 05:23:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 05:23:21,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148887174] [2024-11-06 05:23:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148887174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:23:21,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:23:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2024-11-06 05:23:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746464430] [2024-11-06 05:23:21,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:23:21,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-06 05:23:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-06 05:23:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-06 05:23:21,505 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-06 05:23:26,047 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 [0] [2024-11-06 05:23:30,387 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 [0] [2024-11-06 05:23:34,663 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 [0] [2024-11-06 05:23:38,684 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 [0] [2024-11-06 05:23:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:43,429 INFO L93 Difference]: Finished difference Result 283 states and 349 transitions. [2024-11-06 05:23:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 05:23:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 111 [2024-11-06 05:23:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:43,432 INFO L225 Difference]: With dead ends: 283 [2024-11-06 05:23:43,432 INFO L226 Difference]: Without dead ends: 194 [2024-11-06 05:23:43,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-06 05:23:43,434 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 144 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 75 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:43,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1039 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 631 Invalid, 4 Unknown, 0 Unchecked, 20.9s Time] [2024-11-06 05:23:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-06 05:23:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2024-11-06 05:23:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 136 states have (on average 1.1397058823529411) internal successors, (155), 138 states have internal predecessors, (155), 28 states have call successors, (28), 15 states have call predecessors, (28), 17 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35) [2024-11-06 05:23:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2024-11-06 05:23:43,462 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 111 [2024-11-06 05:23:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:43,463 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2024-11-06 05:23:43,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-06 05:23:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2024-11-06 05:23:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 05:23:43,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:43,466 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:43,479 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 [2024-11-06 05:23:43,666 WARN L453 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 [2024-11-06 05:23:43,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -524350022, now seen corresponding path program 1 times [2024-11-06 05:23:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461844739] [2024-11-06 05:23:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:43,668 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 [2024-11-06 05:23:43,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:43,669 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) [2024-11-06 05:23:43,670 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 [2024-11-06 05:23:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:43,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 05:23:43,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:44,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2024-11-06 05:23:44,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-06 05:23:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-06 05:23:47,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:47,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461844739] [2024-11-06 05:23:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461844739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 05:23:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181679437] [2024-11-06 05:23:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:23:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:23:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:23:47,411 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)