/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:46:16,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:46:16,655 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-04 20:46:16,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:46:16,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:46:16,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:46:16,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:46:16,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:46:16,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:46:16,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:46:16,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:46:16,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:46:16,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:46:16,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:46:16,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:46:16,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:46:16,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:46:16,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:46:16,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:46:16,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:46:16,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:46:16,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:46:16,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:46:16,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:46:16,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:46:16,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:46:16,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:46:16,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:46:16,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:46:16,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:46:16,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:46:16,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:16,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:46:16,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:46:16,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:46:16,702 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:46:16,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:16,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:46:16,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:46:16,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:46:16,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:46:16,704 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:16,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:46:17,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:46:17,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:46:17,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:46:17,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:46:17,013 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_begin_harness_negated.i [2024-11-04 20:46:18,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:46:19,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:46:19,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-04 20:46:19,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3181856/1e0d0e7cdbd54114974c2c611b100e09/FLAG7e0fafad0 [2024-11-04 20:46:19,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3181856/1e0d0e7cdbd54114974c2c611b100e09 [2024-11-04 20:46:19,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:46:19,155 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:46:19,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:19,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:46:19,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:46:19,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1059a0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:19, skipping insertion in model container [2024-11-04 20:46:19,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:19" (1/1) ... [2024-11-04 20:46:19,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:19,637 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_begin_harness_negated.i[4495,4508] [2024-11-04 20:46:19,652 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_begin_harness_negated.i[4555,4568] [2024-11-04 20:46:20,613 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-04 20:46:20,747 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-04 20:46:20,748 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-04 20:46:20,751 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-04 20:46:20,762 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-04 20:46:20,763 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,764 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,764 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,765 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-04 20:46:20,765 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,766 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,768 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-04 20:46:20,769 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-04 20:46:20,771 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-04 20:46:20,771 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-04 20:46:20,778 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,778 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-04 20:46:20,779 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,779 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-04 20:46:20,780 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,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-04 20:46:20,784 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,785 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-04 20:46:20,786 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,787 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-04 20:46:20,787 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,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-04 20:46:20,788 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:20,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,023 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-04 20:46:21,023 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-04 20:46:21,024 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-04 20:46:21,024 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-04 20:46:21,151 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-04 20:46:21,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,190 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:46:21,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:21,224 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_begin_harness_negated.i[4495,4508] [2024-11-04 20:46:21,225 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_begin_harness_negated.i[4555,4568] [2024-11-04 20:46:21,254 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-04 20:46:21,272 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-04 20:46:21,272 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-04 20:46:21,272 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-04 20:46:21,280 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-04 20:46:21,286 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,286 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,286 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,287 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-04 20:46:21,287 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,287 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,289 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-04 20:46:21,289 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-04 20:46:21,290 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-04 20:46:21,290 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-04 20:46:21,294 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,294 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-04 20:46:21,294 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,294 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-04 20:46:21,295 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,296 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-04 20:46:21,296 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,296 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-04 20:46:21,297 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,297 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-04 20:46:21,298 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,298 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-04 20:46:21,298 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,298 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,353 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-04 20:46:21,356 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-04 20:46:21,357 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-04 20:46:21,357 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-04 20:46:21,395 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-04 20:46:21,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:46:21,439 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_begin_harness_negated.i[4495,4508] [2024-11-04 20:46:21,439 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_begin_harness_negated.i[4555,4568] [2024-11-04 20:46:21,485 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,485 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,486 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,486 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,487 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,497 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,497 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,498 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,501 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,502 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,503 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,503 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,503 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:21,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:21,871 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:46:21,880 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:46:21,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21 WrapperNode [2024-11-04 20:46:21,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:21,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:21,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:46:21,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:46:21,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:21,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,017 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-04 20:46:22,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:22,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:46:22,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:46:22,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:46:22,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,069 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2024-11-04 20:46:22,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:46:22,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:46:22,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:46:22,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:46:22,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (1/1) ... [2024-11-04 20:46:22,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:22,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:46:22,156 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-04 20:46:22,159 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-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:46:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:46:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:46:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:46:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:46:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:46:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:46:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:46:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:46:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:46:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:46:22,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:46:22,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:46:22,854 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-04 20:46:22,854 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:46:22,870 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:46:22,870 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:46:22,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:22 BoogieIcfgContainer [2024-11-04 20:46:22,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:46:22,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:46:22,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:46:22,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:46:22,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:46:19" (1/3) ... [2024-11-04 20:46:22,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f05a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:22, skipping insertion in model container [2024-11-04 20:46:22,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:21" (2/3) ... [2024-11-04 20:46:22,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f05a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:22, skipping insertion in model container [2024-11-04 20:46:22,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:22" (3/3) ... [2024-11-04 20:46:22,879 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2024-11-04 20:46:22,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:46:22,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:46:22,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:46:22,963 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;@444e5e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:46:22,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:46:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-04 20:46:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:22,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:22,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:22,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-04 20:46:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739705795] [2024-11-04 20:46:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:22,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-04 20:46:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:23,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:46:23,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:23,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:46:23,378 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:23,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739705795] [2024-11-04 20:46:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [739705795] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:46:23,379 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:46:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:46:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772726774] [2024-11-04 20:46:23,382 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:23,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:46:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:46:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:23,413 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:46:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:23,443 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-04 20:46:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:46:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-11-04 20:46:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:23,452 INFO L225 Difference]: With dead ends: 130 [2024-11-04 20:46:23,452 INFO L226 Difference]: Without dead ends: 64 [2024-11-04 20:46:23,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-04 20:46:23,458 INFO L432 NwaCegarLoop]: 88 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, 88 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-04 20:46:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-04 20:46:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-04 20:46:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-04 20:46:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-04 20:46:23,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-04 20:46:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-04 20:46:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:46:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-04 20:46:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:46:23,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:23,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:23,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:23,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:23,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:23,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-04 20:46:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:23,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187814132] [2024-11-04 20:46:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:23,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:23,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-04 20:46:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:24,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:24,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:46:24,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:24,299 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [187814132] [2024-11-04 20:46:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [187814132] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:24,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:24,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932833822] [2024-11-04 20:46:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:24,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:24,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:24,305 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:46:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:24,389 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-04 20:46:24,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:24,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-04 20:46:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:24,395 INFO L225 Difference]: With dead ends: 116 [2024-11-04 20:46:24,396 INFO L226 Difference]: Without dead ends: 66 [2024-11-04 20:46:24,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:24,398 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:24,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-04 20:46:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-04 20:46:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-04 20:46:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-04 20:46:24,409 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-04 20:46:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-04 20:46:24,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-04 20:46:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-04 20:46:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-04 20:46:24,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:24,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:24,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-04 20:46:24,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:24,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-04 20:46:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281718472] [2024-11-04 20:46:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:24,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:24,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:24,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-04 20:46:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:24,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:24,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:46:24,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:46:25,186 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281718472] [2024-11-04 20:46:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [281718472] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-04 20:46:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561571713] [2024-11-04 20:46:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:25,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:25,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:25,188 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:25,334 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-04 20:46:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-04 20:46:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:25,337 INFO L225 Difference]: With dead ends: 123 [2024-11-04 20:46:25,337 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:46:25,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:25,339 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:25,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 300 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:46:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:46:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-04 20:46:25,350 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-04 20:46:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-04 20:46:25,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-04 20:46:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-04 20:46:25,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:25,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:25,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-04 20:46:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:25,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-04 20:46:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550341767] [2024-11-04 20:46:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:25,559 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:25,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:25,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-04 20:46:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:25,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-04 20:46:25,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-04 20:46:25,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-04 20:46:26,048 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550341767] [2024-11-04 20:46:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1550341767] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:26,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-04 20:46:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54113280] [2024-11-04 20:46:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:26,050 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:26,243 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-04 20:46:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:46:26,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-04 20:46:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:26,246 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:46:26,246 INFO L226 Difference]: Without dead ends: 80 [2024-11-04 20:46:26,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-04 20:46:26,247 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:26,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-04 20:46:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-04 20:46:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-04 20:46:26,260 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-04 20:46:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:26,260 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-04 20:46:26,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-04 20:46:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-04 20:46:26,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:26,262 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:26,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-04 20:46:26,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:26,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-04 20:46:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:26,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766161707] [2024-11-04 20:46:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:26,464 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:26,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:26,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-04 20:46:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:26,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:26,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:26,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:46:26,833 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766161707] [2024-11-04 20:46:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [766161707] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-04 20:46:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691899174] [2024-11-04 20:46:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:26,835 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:26,953 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-04 20:46:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-04 20:46:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:26,955 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:46:26,955 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:46:26,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:26,956 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:26,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:46:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-04 20:46:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-04 20:46:27,000 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-04 20:46:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:27,000 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-04 20:46:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-04 20:46:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-04 20:46:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-04 20:46:27,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:27,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-04 20:46:27,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:27,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:27,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-04 20:46:27,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:27,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570595746] [2024-11-04 20:46:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:27,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:27,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:27,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-04 20:46:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:27,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:27,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-04 20:46:27,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:27,758 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570595746] [2024-11-04 20:46:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [570595746] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:27,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283848818] [2024-11-04 20:46:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:27,760 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:27,814 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-04 20:46:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-04 20:46:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:27,816 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:46:27,816 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:46:27,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:27,817 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:27,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:46:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-04 20:46:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-04 20:46:27,826 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-04 20:46:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-04 20:46:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-04 20:46:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-04 20:46:27,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:27,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:27,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-04 20:46:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:28,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-04 20:46:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:28,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45560031] [2024-11-04 20:46:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:28,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:28,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:28,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-04 20:46:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:28,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:28,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-04 20:46:28,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-04 20:46:28,535 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45560031] [2024-11-04 20:46:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [45560031] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:28,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154659149] [2024-11-04 20:46:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:28,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:28,537 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:28,594 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2024-11-04 20:46:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-11-04 20:46:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:28,597 INFO L225 Difference]: With dead ends: 127 [2024-11-04 20:46:28,597 INFO L226 Difference]: Without dead ends: 75 [2024-11-04 20:46:28,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:28,601 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:28,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-04 20:46:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-04 20:46:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 57 states have internal predecessors, (67), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:46:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-11-04 20:46:28,619 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 83 [2024-11-04 20:46:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-04 20:46:28,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-11-04 20:46:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-04 20:46:28,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:28,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:28,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-04 20:46:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -425725907, now seen corresponding path program 1 times [2024-11-04 20:46:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901895172] [2024-11-04 20:46:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:28,823 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:28,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:28,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:28,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-04 20:46:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:29,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:46:29,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:46:29,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:29,323 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901895172] [2024-11-04 20:46:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1901895172] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:29,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-04 20:46:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748566183] [2024-11-04 20:46:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:46:29,326 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:29,474 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-04 20:46:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-11-04 20:46:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:29,477 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:46:29,477 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:46:29,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:29,478 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:29,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 363 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:46:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-04 20:46:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-04 20:46:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-04 20:46:29,496 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 85 [2024-11-04 20:46:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:29,496 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-04 20:46:29,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-04 20:46:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-04 20:46:29,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:29,498 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:29,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-04 20:46:29,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:29,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:29,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 439771770, now seen corresponding path program 2 times [2024-11-04 20:46:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2101274925] [2024-11-04 20:46:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:29,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:29,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-04 20:46:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:29,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:29,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-04 20:46:30,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:30,222 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2101274925] [2024-11-04 20:46:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2101274925] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:30,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-04 20:46:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998666575] [2024-11-04 20:46:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:46:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:46:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:46:30,224 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:30,418 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2024-11-04 20:46:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-04 20:46:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2024-11-04 20:46:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:30,420 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:46:30,420 INFO L226 Difference]: Without dead ends: 76 [2024-11-04 20:46:30,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-04 20:46:30,421 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:30,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 408 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-04 20:46:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-04 20:46:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.24) internal successors, (62), 53 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-04 20:46:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-04 20:46:30,429 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 87 [2024-11-04 20:46:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-04 20:46:30,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-04 20:46:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-04 20:46:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-04 20:46:30,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:30,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:30,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-04 20:46:30,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:30,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -959329865, now seen corresponding path program 1 times [2024-11-04 20:46:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392483983] [2024-11-04 20:46:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:30,635 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:30,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-04 20:46:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:31,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:31,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-04 20:46:31,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-04 20:46:31,261 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392483983] [2024-11-04 20:46:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1392483983] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260886303] [2024-11-04 20:46:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:31,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:31,263 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:31,311 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2024-11-04 20:46:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-04 20:46:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:31,313 INFO L225 Difference]: With dead ends: 121 [2024-11-04 20:46:31,313 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:46:31,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:31,314 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:31,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:46:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:46:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-04 20:46:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-11-04 20:46:31,323 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 96 [2024-11-04 20:46:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:31,323 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-11-04 20:46:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-04 20:46:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-04 20:46:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:46:31,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:31,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:46:31,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-04 20:46:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:31,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1252523644, now seen corresponding path program 3 times [2024-11-04 20:46:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786791896] [2024-11-04 20:46:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:31,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:31,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:31,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:31,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-04 20:46:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:32,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-04 20:46:32,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:32,372 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-04 20:46:32,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-04 20:46:32,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-04 20:46:32,561 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-04 20:46:32,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-04 20:46:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-04 20:46:32,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:46:32,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-04 20:46:32,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:46:32,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-04 20:46:32,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:46:32,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-11-04 20:46:32,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:46:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2024-11-04 20:46:32,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:46:33,175 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2)))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse3 .cse2 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) is different from true [2024-11-04 20:46:33,628 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2)))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse3 .cse2 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))) (.cse4 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|)))) (or (and |c_aws_linked_list_is_valid_#t~short297#1| (or (not .cse4) (not .cse5))) (and .cse5 .cse4 (not |c_aws_linked_list_is_valid_#t~short297#1|))))) is different from true [2024-11-04 20:46:38,077 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2)))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse3 .cse2 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))))) is different from true [2024-11-04 20:46:38,402 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2)))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse3 .cse2 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)))))) is different from true [2024-11-04 20:46:38,683 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2))) (and (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 .cse2 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2)))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (store .cse3 .cse2 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))))) is different from true [2024-11-04 20:46:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-04 20:46:38,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-04 20:46:39,485 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786791896] [2024-11-04 20:46:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [786791896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:46:39,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:46:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2024-11-04 20:46:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132826373] [2024-11-04 20:46:39,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:46:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-04 20:46:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-04 20:46:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=171, Unknown=12, NotChecked=150, Total=380 [2024-11-04 20:46:39,487 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:46:44,236 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-04 20:46:48,611 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-04 20:46:54,948 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-04 20:46:59,738 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-04 20:47:04,055 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-04 20:47:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:47:04,201 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-04 20:47:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-04 20:47:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-04 20:47:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:47:04,203 INFO L225 Difference]: With dead ends: 183 [2024-11-04 20:47:04,203 INFO L226 Difference]: Without dead ends: 122 [2024-11-04 20:47:04,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=84, Invalid=382, Unknown=16, NotChecked=220, Total=702 [2024-11-04 20:47:04,205 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 8 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2024-11-04 20:47:04,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 520 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 479 Invalid, 32 Unknown, 955 Unchecked, 23.9s Time] [2024-11-04 20:47:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-04 20:47:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2024-11-04 20:47:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 87 states have internal predecessors, (111), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:47:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 145 transitions. [2024-11-04 20:47:04,226 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 145 transitions. Word has length 98 [2024-11-04 20:47:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:47:04,227 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 145 transitions. [2024-11-04 20:47:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 18 states have internal predecessors, (107), 6 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-04 20:47:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 145 transitions. [2024-11-04 20:47:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:47:04,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:47:04,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:47:04,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-04 20:47:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:04,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:47:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:47:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 479996356, now seen corresponding path program 1 times [2024-11-04 20:47:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:47:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895920379] [2024-11-04 20:47:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:47:04,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:04,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:47:04,432 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:47:04,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-04 20:47:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:47:04,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:47:04,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:47:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-04 20:47:04,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:47:04,720 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895920379] [2024-11-04 20:47:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [895920379] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:47:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:47:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:47:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378667632] [2024-11-04 20:47:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:47:04,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:47:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:47:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:47:04,723 INFO L87 Difference]: Start difference. First operand 110 states and 145 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:47:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:47:04,759 INFO L93 Difference]: Finished difference Result 181 states and 244 transitions. [2024-11-04 20:47:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:47:04,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-04 20:47:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:47:04,761 INFO L225 Difference]: With dead ends: 181 [2024-11-04 20:47:04,761 INFO L226 Difference]: Without dead ends: 112 [2024-11-04 20:47:04,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 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-04 20:47:04,762 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 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-04 20:47:04,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:47:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-04 20:47:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-04 20:47:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:47:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2024-11-04 20:47:04,778 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 98 [2024-11-04 20:47:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:47:04,778 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2024-11-04 20:47:04,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:47:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2024-11-04 20:47:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:47:04,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:47:04,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:47:04,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-04 20:47:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:04,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:47:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:47:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1800233476, now seen corresponding path program 1 times [2024-11-04 20:47:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:47:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781963766] [2024-11-04 20:47:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:47:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:04,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:47:04,983 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:47:04,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-04 20:47:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:47:05,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:47:05,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:47:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:47:05,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-04 20:47:05,264 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781963766] [2024-11-04 20:47:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1781963766] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:47:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:47:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:47:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997750082] [2024-11-04 20:47:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:47:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:47:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:47:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:47:05,267 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:47:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:47:05,315 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2024-11-04 20:47:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:47:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-04 20:47:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:47:05,317 INFO L225 Difference]: With dead ends: 197 [2024-11-04 20:47:05,317 INFO L226 Difference]: Without dead ends: 105 [2024-11-04 20:47:05,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 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-04 20:47:05,319 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 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-04 20:47:05,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:47:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-04 20:47:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-04 20:47:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:47:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2024-11-04 20:47:05,336 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 98 [2024-11-04 20:47:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:47:05,337 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2024-11-04 20:47:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-04 20:47:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2024-11-04 20:47:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:47:05,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:47:05,338 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-04 20:47:05,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-04 20:47:05,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:05,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:47:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:47:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -596272544, now seen corresponding path program 1 times [2024-11-04 20:47:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:47:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550832900] [2024-11-04 20:47:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:47:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:47:05,542 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:47:05,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-04 20:47:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:47:06,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:47:06,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:47:06,145 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-04 20:47:06,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-04 20:47:06,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-04 20:47:06,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:47:06,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-04 20:47:06,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-04 20:47:06,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-04 20:47:06,375 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-04 20:47:06,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-04 20:47:06,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-04 20:47:06,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:47:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-04 20:47:06,450 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-04 20:47:06,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2024-11-04 20:47:06,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-04 20:47:06,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) (_ bv24 64)))) (let ((.cse0 (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| .cse1))) (and (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) (or .cse0 (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| v_DerPreprocessor_6) .cse1))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) (= v_DerPreprocessor_6 (store .cse2 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) (_ bv24 64)))))))) (or .cse0 (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| (store .cse3 (_ bv24 64) .cse1)) .cse1) .cse3))))))) is different from true [2024-11-04 20:47:06,537 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse1))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (store .cse3 (_ bv24 64) .cse1)) .cse1)))) (= (store .cse2 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6)))))) is different from true [2024-11-04 20:47:07,082 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv16 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse0) (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse0)) (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse1))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (store .cse3 (_ bv24 64) .cse1)) .cse1)))) (= (store .cse2 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6)))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4)))) is different from true [2024-11-04 20:47:07,270 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (let ((.cse0 (bvadd (_ bv16 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse0)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse1) (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse1)) (= .cse1 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse2))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (store .cse4 (_ bv24 64) .cse2)) .cse2)))) (= (store .cse3 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6))))))) is different from true [2024-11-04 20:47:11,499 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|))) (let ((.cse11 (select .cse17 (_ bv24 64)))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (.cse12 (= .cse11 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|))) (and (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select .cse0 (_ bv16 64))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (store .cse1 (_ bv24 64) .cse2)) .cse2)))) (= (_ bv0 64) (select .cse3 (_ bv16 64))) (= (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) (= v_DerPreprocessor_6 (store .cse4 (_ bv24 64) (select .cse0 (_ bv24 64))))))))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (let ((.cse5 (select .cse6 (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (_ bv0 64) (select .cse6 (_ bv16 64))) (= (select |c_#memory_$Pointer$#1.offset| .cse5) (select (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (select .cse7 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (_ bv0 64) (select .cse7 (_ bv16 64))))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (let ((.cse8 (bvadd (_ bv16 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse8)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse8))))) (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.offset| .cse11 v_DerPreprocessor_5) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| v_DerPreprocessor_6) .cse11))) (and (= v_DerPreprocessor_6 (store .cse9 (_ bv24 64) (select .cse10 (_ bv24 64)))) (= .cse9 (select |c_#memory_$Pointer$#1.offset| .cse11))))) .cse12) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse13) (select (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse13)) (= .cse13 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$#1.offset| .cse14 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse14))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse14) .cse15) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse14))) (= .cse16 (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (store .cse16 (_ bv24 64) .cse14)) .cse14)))) (= (store .cse15 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6)))))) (= (_ bv0 64) (select .cse17 (_ bv16 64))) (= (_ bv0 64) (select .cse10 (_ bv16 64))) (or (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse11))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| (store .cse18 (_ bv24 64) .cse11)) .cse11) .cse18))) .cse12) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset|))))) is different from true [2024-11-04 20:47:18,972 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (_ bv0 64) (select .cse0 (_ bv16 64))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (store .cse1 (_ bv24 64) .cse2)) .cse2)))) (= (_ bv0 64) (select .cse3 (_ bv16 64))) (= (select |c_#memory_$Pointer$#1.offset| .cse2) .cse4) (= v_DerPreprocessor_6 (store .cse4 (_ bv24 64) (select .cse0 (_ bv24 64))))))))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (let ((.cse5 (select .cse6 (_ bv24 64)))) (and (= .cse5 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (_ bv0 64) (select .cse6 (_ bv16 64))) (= (select |c_#memory_$Pointer$#1.offset| .cse5) (select (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| v_DerPreprocessor_6) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|))) (and (= (select .cse7 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_36|) (_ bv16 64))) (= (_ bv0 64) (select .cse7 (_ bv16 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (= (select .cse8 (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= (_ bv0 64) (select .cse8 (_ bv16 64)))))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (let ((.cse9 (select .cse13 (_ bv24 64)))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_6) .cse9)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (store .cse10 (_ bv24 64) .cse9)) .cse9) .cse10))) (= (_ bv0 64) (select .cse11 (_ bv16 64))) (= .cse12 (select |c_#memory_$Pointer$#1.offset| .cse9)) (= (_ bv0 64) (select .cse13 (_ bv16 64))) (= v_DerPreprocessor_6 (store .cse12 (_ bv24 64) (select .cse11 (_ bv24 64))))))))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (_ BitVec 64))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (let ((.cse14 (select .cse15 (_ bv24 64)))) (and (= .cse14 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (_ bv16 64))) (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse14 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| v_DerPreprocessor_6) .cse14) (select |c_#memory_$Pointer$#1.offset| .cse14)) (= (_ bv0 64) (select .cse15 (_ bv16 64)))))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (let ((.cse16 (bvadd (_ bv16 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_2|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse16)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_2|) .cse16))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse17) (select (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse17)) (= .cse17 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (let ((.cse19 (select (store (store |c_#memory_$Pointer$#1.offset| .cse18 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_6) .cse18))) (and (= (select |c_#memory_$Pointer$#1.offset| .cse18) .cse19) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| .cse18))) (= .cse20 (select (store (store |c_#memory_$Pointer$#1.base| .cse18 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35| (store .cse20 (_ bv24 64) .cse18)) .cse18)))) (= (store .cse19 (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64))) v_DerPreprocessor_6)))))) (or (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse25 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (let ((.cse22 (select .cse25 (_ bv24 64)))) (let ((.cse21 (select (store (store |c_#memory_$Pointer$#1.offset| .cse22 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_6) .cse22)) (.cse23 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (= .cse21 (select |c_#memory_$Pointer$#1.offset| .cse22)) (= v_DerPreprocessor_6 (store .cse21 (_ bv24 64) (select .cse23 (_ bv24 64)))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| .cse22))) (= .cse24 (select (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (store .cse24 (_ bv24 64) .cse22)) .cse22)))) (= (_ bv0 64) (select .cse23 (_ bv16 64))) (= (_ bv0 64) (select .cse25 (_ bv16 64)))))))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (let ((.cse26 (select .cse27 (_ bv24 64)))) (and (= (select (store (store |c_#memory_$Pointer$#1.offset| .cse26 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| v_DerPreprocessor_6) .cse26) (select |c_#memory_$Pointer$#1.offset| .cse26)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| .cse26) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (= (_ bv0 64) (select .cse27 (_ bv16 64))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (_ BitVec 64))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse28 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (_ bv16 64))) (= (_ bv0 64) (select .cse28 (_ bv16 64)))))))) is different from true [2024-11-04 20:47:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 21 not checked. [2024-11-04 20:47:42,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:47:45,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550832900] [2024-11-04 20:47:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [550832900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:47:45,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:47:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 30 [2024-11-04 20:47:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196289224] [2024-11-04 20:47:45,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:47:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-04 20:47:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:45,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-04 20:47:45,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=435, Unknown=41, NotChecked=294, Total=870 [2024-11-04 20:47:45,412 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand has 30 states, 27 states have (on average 5.111111111111111) internal successors, (138), 24 states have internal predecessors, (138), 13 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-04 20:47:49,542 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]