/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_rbegin_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:48:12,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:48:12,993 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:48:12,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:48:12,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:48:13,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:48:13,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:48:13,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:48:13,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:48:13,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:48:13,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:48:13,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:48:13,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:48:13,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:48:13,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:48:13,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:48:13,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:48:13,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:48:13,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:48:13,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:48:13,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:48:13,033 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:48:13,033 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:48:13,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:48:13,033 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:48:13,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:48:13,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:48:13,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:48:13,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:48:13,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:48:13,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:48:13,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:48:13,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:48:13,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:48:13,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:48:13,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:48:13,037 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:48:13,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:48:13,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:48:13,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:48:13,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:48:13,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:48:13,261 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_rbegin_harness.i [2024-11-04 20:48:14,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:48:15,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:48:15,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness.i [2024-11-04 20:48:15,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef119763a/f1d7cc153a284ae29e39da4a3a9c5dea/FLAG220a7906b [2024-11-04 20:48:15,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef119763a/f1d7cc153a284ae29e39da4a3a9c5dea [2024-11-04 20:48:15,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:48:15,127 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:48:15,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:48:15,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:48:15,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:48:15,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:48:15" (1/1) ... [2024-11-04 20:48:15,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da1188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:15, skipping insertion in model container [2024-11-04 20:48:15,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:48:15" (1/1) ... [2024-11-04 20:48:15,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:48:15,447 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_rbegin_harness.i[4496,4509] [2024-11-04 20:48:15,455 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_rbegin_harness.i[4556,4569] [2024-11-04 20:48:15,958 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:48:16,016 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:48:16,016 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:48:16,017 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:48:16,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:48:16,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,026 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,026 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:48:16,026 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,027 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,029 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:48:16,030 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:48:16,031 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:48:16,031 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:48:16,037 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,038 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:48:16,038 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,038 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:48:16,039 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,040 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:48:16,040 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,040 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:48:16,041 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,042 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:48:16,042 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,043 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:48:16,043 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,043 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,330 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:48:16,331 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:48:16,334 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:48:16,334 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:48:16,452 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:48:16,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:16,498 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:48:16,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:48:16,541 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_rbegin_harness.i[4496,4509] [2024-11-04 20:48:16,543 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_rbegin_harness.i[4556,4569] [2024-11-04 20:48:16,569 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:48:16,585 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:48:16,585 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:48:16,586 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:48:16,593 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:48:16,594 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,594 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,595 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,595 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:48:16,595 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,595 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,597 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:48:16,597 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:48:16,598 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:48:16,598 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:48:16,601 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,601 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:48:16,601 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,601 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:48:16,602 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,606 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:48:16,606 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,607 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:48:16,608 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,608 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:48:16,608 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,609 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:48:16,609 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,609 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,700 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:48:16,700 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:48:16,700 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:48:16,700 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:48:16,724 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:48:16,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:16,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:48:16,749 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_rbegin_harness.i[4496,4509] [2024-11-04 20:48:16,749 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_rbegin_harness.i[4556,4569] [2024-11-04 20:48:16,782 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,782 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,782 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,782 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,783 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,787 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,787 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,788 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:48:16,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:48:16,949 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:48:16,955 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:48:16,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16 WrapperNode [2024-11-04 20:48:16,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:48:16,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:48:16,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:48:16,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:48:16,961 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:48:16" (1/1) ... [2024-11-04 20:48:17,019 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:48:16" (1/1) ... [2024-11-04 20:48:17,062 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-04 20:48:17,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:48:17,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:48:17,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:48:17,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:48:17,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,105 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-04 20:48:17,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:48:17,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:48:17,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:48:17,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:48:17,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (1/1) ... [2024-11-04 20:48:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:48:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:48:17,178 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:48:17,185 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:48:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:48:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:48:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:48:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:48:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:48:17,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:48:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:48:17,211 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:48:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:48:17,211 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:48:17,211 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:48:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:48:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:48:17,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:48:17,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:48:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:48:17,214 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:48:17,214 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:48:17,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:48:17,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:48:17,754 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-04 20:48:17,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:48:17,765 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:48:17,765 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:48:17,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:48:17 BoogieIcfgContainer [2024-11-04 20:48:17,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:48:17,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:48:17,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:48:17,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:48:17,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:48:15" (1/3) ... [2024-11-04 20:48:17,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f89da57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:48:17, skipping insertion in model container [2024-11-04 20:48:17,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:48:16" (2/3) ... [2024-11-04 20:48:17,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f89da57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:48:17, skipping insertion in model container [2024-11-04 20:48:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:48:17" (3/3) ... [2024-11-04 20:48:17,771 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2024-11-04 20:48:17,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:48:17,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:48:17,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:48:17,846 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;@33b14294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:48:17,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:48:17,852 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:48:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:48:17,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:17,860 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:48:17,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-04 20:48:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596607023] [2024-11-04 20:48:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:17,879 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:48:17,880 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:48:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:18,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:48:18,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:18,161 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:48:18,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:18,208 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:48:18,209 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596607023] [2024-11-04 20:48:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1596607023] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:48:18,209 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:48:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:48:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193202336] [2024-11-04 20:48:18,214 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:18,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:48:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:18,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:48:18,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:48:18,238 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:48:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:18,260 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-04 20:48:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:48:18,263 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:48:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:18,272 INFO L225 Difference]: With dead ends: 130 [2024-11-04 20:48:18,273 INFO L226 Difference]: Without dead ends: 64 [2024-11-04 20:48:18,276 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:48:18,278 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:48:18,279 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:48:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-04 20:48:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-04 20:48:18,311 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:48:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-04 20:48:18,317 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-04 20:48:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:18,317 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-04 20:48:18,317 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:48:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-04 20:48:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-04 20:48:18,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:18,322 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:48:18,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-04 20:48:18,523 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:48:18,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-04 20:48:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985607055] [2024-11-04 20:48:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:18,524 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:18,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:18,530 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:48:18,531 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:48:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:18,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:48:18,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:18,925 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:48:18,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:18,993 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:48:18,993 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985607055] [2024-11-04 20:48:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1985607055] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:18,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:48:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996187114] [2024-11-04 20:48:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:18,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:19,000 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:48:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:19,045 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-04 20:48:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:19,045 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:48:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:19,047 INFO L225 Difference]: With dead ends: 116 [2024-11-04 20:48:19,047 INFO L226 Difference]: Without dead ends: 66 [2024-11-04 20:48:19,048 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:48:19,048 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.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:19,049 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.0s Time] [2024-11-04 20:48:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-04 20:48:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-04 20:48:19,055 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:48:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-04 20:48:19,056 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-04 20:48:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-04 20:48:19,057 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:48:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-04 20:48:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-04 20:48:19,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:19,058 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:48:19,066 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:48:19,258 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:48:19,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-04 20:48:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135205631] [2024-11-04 20:48:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:19,262 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:48:19,263 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:48:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:19,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:19,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:19,534 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:48:19,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:19,681 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:48:19,681 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2135205631] [2024-11-04 20:48:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2135205631] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-04 20:48:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366235099] [2024-11-04 20:48:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:19,683 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:48:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:19,799 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-04 20:48:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:19,799 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:48:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:19,800 INFO L225 Difference]: With dead ends: 123 [2024-11-04 20:48:19,800 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:48:19,801 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:48:19,802 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:48:19,802 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:48:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:48:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:48:19,808 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:48:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-04 20:48:19,809 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-04 20:48:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:19,809 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-04 20:48:19,810 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:48:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-04 20:48:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-04 20:48:19,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:19,811 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:48:19,818 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:48:20,013 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:48:20,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-04 20:48:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562011836] [2024-11-04 20:48:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:20,020 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:48:20,029 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:48:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:20,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-04 20:48:20,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:20,430 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:48:20,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:20,581 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:48:20,582 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562011836] [2024-11-04 20:48:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [562011836] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:20,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-04 20:48:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804304973] [2024-11-04 20:48:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:48:20,584 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:48:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:20,741 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-04 20:48:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:48:20,742 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:48:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:20,743 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:48:20,743 INFO L226 Difference]: Without dead ends: 80 [2024-11-04 20:48:20,744 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:48:20,744 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.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:20,745 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.1s Time] [2024-11-04 20:48:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-04 20:48:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-04 20:48:20,753 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:48:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-04 20:48:20,754 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-04 20:48:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-04 20:48:20,754 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:48:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-04 20:48:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-04 20:48:20,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:20,756 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:48:20,761 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:48:20,956 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:48:20,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-04 20:48:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913297093] [2024-11-04 20:48:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:20,965 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:48:20,971 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:48:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:21,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:48:21,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:21,216 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:48:21,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:21,257 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:48:21,258 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913297093] [2024-11-04 20:48:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913297093] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-04 20:48:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590334908] [2024-11-04 20:48:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:21,260 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:48:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:21,351 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-04 20:48:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:21,351 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:48:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:21,353 INFO L225 Difference]: With dead ends: 135 [2024-11-04 20:48:21,353 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:48:21,353 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:48:21,354 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:48:21,354 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:48:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:48:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-04 20:48:21,362 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:48:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-04 20:48:21,363 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-04 20:48:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:21,364 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-04 20:48:21,364 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:48:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-04 20:48:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-04 20:48:21,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:21,365 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:48:21,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-04 20:48:21,565 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:48:21,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-04 20:48:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913504022] [2024-11-04 20:48:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:21,574 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:48:21,576 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:48:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:21,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:21,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:21,983 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:48:21,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:22,095 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:48:22,095 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913504022] [2024-11-04 20:48:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1913504022] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:22,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:48:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739486513] [2024-11-04 20:48:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:22,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:22,101 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:48:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:22,174 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-04 20:48:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:22,177 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:48:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:22,178 INFO L225 Difference]: With dead ends: 136 [2024-11-04 20:48:22,178 INFO L226 Difference]: Without dead ends: 78 [2024-11-04 20:48:22,179 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:48:22,183 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.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:22,183 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.1s Time] [2024-11-04 20:48:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-04 20:48:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-04 20:48:22,201 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:48:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-04 20:48:22,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-04 20:48:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:22,203 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-04 20:48:22,203 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:48:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-04 20:48:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-04 20:48:22,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:22,205 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:48:22,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:22,405 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:48:22,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:22,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-04 20:48:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462684923] [2024-11-04 20:48:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:22,407 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:22,409 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:48:22,410 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:48:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:22,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:48:22,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:22,809 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:48:22,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:22,871 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:48:22,871 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462684923] [2024-11-04 20:48:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1462684923] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:48:22,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612135275] [2024-11-04 20:48:22,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:22,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:48:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:22,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:48:22,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:48:22,873 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:48:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:22,908 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2024-11-04 20:48:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:48:22,909 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:48:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:22,910 INFO L225 Difference]: With dead ends: 127 [2024-11-04 20:48:22,910 INFO L226 Difference]: Without dead ends: 75 [2024-11-04 20:48:22,911 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:48:22,911 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:48:22,911 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:48:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-04 20:48:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-04 20:48:22,923 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:48:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-11-04 20:48:22,924 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 83 [2024-11-04 20:48:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:22,924 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-11-04 20:48:22,925 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:48:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2024-11-04 20:48:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-04 20:48:22,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:22,926 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:48:22,932 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:48:23,126 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:48:23,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:23,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -425725907, now seen corresponding path program 1 times [2024-11-04 20:48:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:23,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304975814] [2024-11-04 20:48:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:23,127 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:23,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:23,130 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:48:23,131 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:48:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:23,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:48:23,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:23,410 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:48:23,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:23,594 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:48:23,594 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304975814] [2024-11-04 20:48:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [304975814] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-04 20:48:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254008576] [2024-11-04 20:48:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:48:23,595 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:48:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:23,731 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-04 20:48:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:23,732 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:48:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:23,733 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:48:23,733 INFO L226 Difference]: Without dead ends: 77 [2024-11-04 20:48:23,733 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:48:23,734 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:48:23,734 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:48:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-04 20:48:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-04 20:48:23,739 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:48:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-04 20:48:23,740 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 85 [2024-11-04 20:48:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:23,740 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-04 20:48:23,740 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:48:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-04 20:48:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-04 20:48:23,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:23,741 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:48:23,744 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:48:23,941 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:48:23,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 439771770, now seen corresponding path program 2 times [2024-11-04 20:48:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415841938] [2024-11-04 20:48:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:23,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:23,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:23,944 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:48:23,944 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:48:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:24,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:48:24,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:24,209 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:48:24,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:24,333 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:48:24,333 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415841938] [2024-11-04 20:48:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1415841938] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-04 20:48:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373019424] [2024-11-04 20:48:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:48:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:48:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:48:24,335 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:48:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:24,523 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2024-11-04 20:48:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-04 20:48:24,524 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:48:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:24,525 INFO L225 Difference]: With dead ends: 138 [2024-11-04 20:48:24,525 INFO L226 Difference]: Without dead ends: 76 [2024-11-04 20:48:24,526 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:48:24,526 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.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:24,526 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.1s Time] [2024-11-04 20:48:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-04 20:48:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-04 20:48:24,538 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:48:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-04 20:48:24,545 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 87 [2024-11-04 20:48:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:24,545 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-04 20:48:24,545 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:48:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-04 20:48:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-04 20:48:24,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:24,546 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:48:24,550 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:48:24,746 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:48:24,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -959329865, now seen corresponding path program 1 times [2024-11-04 20:48:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:24,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1528910497] [2024-11-04 20:48:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:24,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:24,749 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:48:24,750 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:48:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:25,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:48:25,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:25,166 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:48:25,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:25,224 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:48:25,224 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1528910497] [2024-11-04 20:48:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1528910497] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:48:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454578050] [2024-11-04 20:48:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:25,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:48:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:48:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:48:25,226 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:48:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:25,273 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2024-11-04 20:48:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:48:25,273 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:48:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:25,274 INFO L225 Difference]: With dead ends: 121 [2024-11-04 20:48:25,274 INFO L226 Difference]: Without dead ends: 71 [2024-11-04 20:48:25,275 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:48:25,275 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:48:25,275 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:48:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-04 20:48:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-04 20:48:25,280 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:48:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-11-04 20:48:25,280 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 96 [2024-11-04 20:48:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:25,280 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-11-04 20:48:25,281 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:48:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-04 20:48:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:25,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:25,281 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:48:25,287 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:48:25,485 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:48:25,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:25,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1252523644, now seen corresponding path program 3 times [2024-11-04 20:48:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:25,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160072041] [2024-11-04 20:48:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:25,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:25,488 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:48:25,489 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:48:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:25,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-04 20:48:25,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:26,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2024-11-04 20:48:26,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-04 20:48:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-04 20:48:26,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-04 20:48:26,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:48:26,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-04 20:48:26,220 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 8 treesize of output 1 [2024-11-04 20:48:26,230 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 8 treesize of output 1 [2024-11-04 20:48:26,419 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rbegin_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 ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) is different from true [2024-11-04 20:48:26,458 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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rbegin_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 ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|)) is different from true [2024-11-04 20:48:27,226 WARN L873 $PredicateComparison]: unable to prove that (and (= |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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rbegin_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 ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) (_ bv0 64))))) is different from true [2024-11-04 20:48:27,337 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rbegin_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 ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (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 (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (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$#2.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|)))))) is different from true [2024-11-04 20:48:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 1 not checked. [2024-11-04 20:48:27,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:28,443 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:48:28,443 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160072041] [2024-11-04 20:48:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [160072041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:48:28,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:48:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2024-11-04 20:48:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941050230] [2024-11-04 20:48:28,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:48:28,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-04 20:48:28,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:28,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-04 20:48:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=195, Unknown=14, NotChecked=124, Total=380 [2024-11-04 20:48:28,449 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:48:29,629 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.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|))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |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_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_~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 (not (= |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| (_ bv0 64))) (not (= (_ bv0 64) |c_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))) (= |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_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_4 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_aws_linked_list_rbegin_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 ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (.cse2 (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|)) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 .cse0)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) .cse2 (select .cse3 .cse2)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31| (_ BitVec 64)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14| (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|) (bvadd (_ bv24 64) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_14|)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_31|))) (or (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|) (_ bv0 64))))) is different from true [2024-11-04 20:48:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:32,296 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-04 20:48:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-04 20:48:32,299 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:48:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:32,303 INFO L225 Difference]: With dead ends: 178 [2024-11-04 20:48:32,303 INFO L226 Difference]: Without dead ends: 119 [2024-11-04 20:48:32,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=17, NotChecked=180, Total=506 [2024-11-04 20:48:32,304 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 49 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 810 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:32,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 562 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 66 Unknown, 810 Unchecked, 3.6s Time] [2024-11-04 20:48:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-04 20:48:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2024-11-04 20:48:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 84 states have internal predecessors, (107), 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:48:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 141 transitions. [2024-11-04 20:48:32,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 141 transitions. Word has length 98 [2024-11-04 20:48:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 141 transitions. [2024-11-04 20:48:32,336 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:48:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 141 transitions. [2024-11-04 20:48:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:32,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:32,342 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:48:32,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-04 20:48:32,542 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:48:32,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:32,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 479996356, now seen corresponding path program 1 times [2024-11-04 20:48:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831376713] [2024-11-04 20:48:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:32,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:32,546 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:48:32,547 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:48:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:32,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:48:32,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:32,778 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:48:32,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:32,812 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:48:32,812 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831376713] [2024-11-04 20:48:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [831376713] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:48:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169544889] [2024-11-04 20:48:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:48:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:48:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:48:32,814 INFO L87 Difference]: Start difference. First operand 107 states and 141 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:48:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:32,837 INFO L93 Difference]: Finished difference Result 178 states and 240 transitions. [2024-11-04 20:48:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:48:32,837 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:48:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:32,838 INFO L225 Difference]: With dead ends: 178 [2024-11-04 20:48:32,838 INFO L226 Difference]: Without dead ends: 112 [2024-11-04 20:48:32,839 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:48:32,839 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:48:32,839 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:48:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-04 20:48:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-04 20:48:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 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:48:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2024-11-04 20:48:32,848 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 98 [2024-11-04 20:48:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2024-11-04 20:48:32,849 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:48:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2024-11-04 20:48:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-04 20:48:32,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:32,850 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:48:32,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:33,055 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:48:33,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:33,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1800233476, now seen corresponding path program 1 times [2024-11-04 20:48:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724070220] [2024-11-04 20:48:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:33,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:33,057 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:48:33,059 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:48:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:33,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:48:33,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:33,278 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:48:33,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:33,312 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:48:33,313 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724070220] [2024-11-04 20:48:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [724070220] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:48:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278833723] [2024-11-04 20:48:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:48:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:48:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:48:33,314 INFO L87 Difference]: Start difference. First operand 109 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:48:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:33,346 INFO L93 Difference]: Finished difference Result 201 states and 271 transitions. [2024-11-04 20:48:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:48:33,347 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:48:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:33,348 INFO L225 Difference]: With dead ends: 201 [2024-11-04 20:48:33,348 INFO L226 Difference]: Without dead ends: 115 [2024-11-04 20:48:33,348 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:48:33,349 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:33,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:48:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-04 20:48:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-11-04 20:48:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 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:48:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2024-11-04 20:48:33,359 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 98 [2024-11-04 20:48:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:33,359 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2024-11-04 20:48:33,359 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:48:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2024-11-04 20:48:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-04 20:48:33,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:33,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,365 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:48:33,560 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:48:33,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:33,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1521790829, now seen corresponding path program 1 times [2024-11-04 20:48:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501388956] [2024-11-04 20:48:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:33,564 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:48:33,567 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:48:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:33,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-04 20:48:33,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-04 20:48:33,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-04 20:48:33,822 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501388956] [2024-11-04 20:48:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [501388956] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:48:33,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:48:33,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-04 20:48:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639310337] [2024-11-04 20:48:33,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:48:33,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-04 20:48:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-04 20:48:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-04 20:48:33,824 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:48:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:33,848 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2024-11-04 20:48:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 20:48:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 99 [2024-11-04 20:48:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:33,849 INFO L225 Difference]: With dead ends: 177 [2024-11-04 20:48:33,849 INFO L226 Difference]: Without dead ends: 104 [2024-11-04 20:48:33,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 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:48:33,850 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:48:33,850 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:48:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-04 20:48:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-04 20:48:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.2125) internal successors, (97), 81 states have internal predecessors, (97), 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:48:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-11-04 20:48:33,858 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 99 [2024-11-04 20:48:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:33,858 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-11-04 20:48:33,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:48:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-11-04 20:48:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:48:33,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:33,859 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:48:33,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:34,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:34,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:34,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -596272544, now seen corresponding path program 1 times [2024-11-04 20:48:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524138536] [2024-11-04 20:48:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:34,060 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:34,061 INFO L229 MonitoredProcess]: Starting monitored process 16 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:48:34,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-04 20:48:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:34,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:48:34,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:34,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-04 20:48:34,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-04 20:48:34,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-04 20:48:34,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:48:34,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-04 20:48:34,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:48:34,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:48:34,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-04 20:48:34,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-04 20:48:34,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-04 20:48:34,655 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:48:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-04 20:48:36,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:48:36,817 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:48:36,818 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:48:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524138536] [2024-11-04 20:48:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [524138536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:48:36,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:48:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-04 20:48:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543380228] [2024-11-04 20:48:36,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:48:36,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-04 20:48:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:48:36,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-04 20:48:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-04 20:48:36,820 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-04 20:48:41,072 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:48:45,352 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:48:49,370 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:48:53,407 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:48:56,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:48:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:48:58,761 INFO L93 Difference]: Finished difference Result 192 states and 238 transitions. [2024-11-04 20:48:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-04 20:48:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 100 [2024-11-04 20:48:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:48:58,767 INFO L225 Difference]: With dead ends: 192 [2024-11-04 20:48:58,767 INFO L226 Difference]: Without dead ends: 127 [2024-11-04 20:48:58,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-11-04 20:48:58,768 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 83 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 41 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-04 20:48:58,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 742 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 418 Invalid, 4 Unknown, 0 Unchecked, 21.4s Time] [2024-11-04 20:48:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-04 20:48:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2024-11-04 20:48:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 95 states have internal predecessors, (111), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:48:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-04 20:48:58,794 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 100 [2024-11-04 20:48:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:48:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-04 20:48:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-04 20:48:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-04 20:48:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:48:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:48:58,796 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-04 20:48:58,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-04 20:48:59,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:59,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:48:59,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:48:59,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1405619170, now seen corresponding path program 1 times [2024-11-04 20:48:59,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:48:59,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [680566045] [2024-11-04 20:48:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:48:59,001 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:48:59,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:48:59,004 INFO L229 MonitoredProcess]: Starting monitored process 17 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:48:59,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-04 20:48:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:48:59,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-04 20:48:59,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:48:59,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-04 20:48:59,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:48:59,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-04 20:49:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-04 20:49:01,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:49:01,829 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-04 20:49:01,829 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-11-04 20:49:01,840 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 72 treesize of output 68 [2024-11-04 20:49:01,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-04 20:49:01,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 93 [2024-11-04 20:49:01,966 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 8 treesize of output 4 [2024-11-04 20:49:01,973 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 22 treesize of output 18 [2024-11-04 20:49:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-04 20:49:02,150 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:49:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [680566045] [2024-11-04 20:49:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [680566045] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:49:02,150 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:49:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2024-11-04 20:49:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547165427] [2024-11-04 20:49:02,150 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:49:02,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-04 20:49:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:49:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-04 20:49:02,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-04 20:49:02,151 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 9 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-04 20:49:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:49:05,012 INFO L93 Difference]: Finished difference Result 291 states and 358 transitions. [2024-11-04 20:49:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-04 20:49:05,012 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 9 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 100 [2024-11-04 20:49:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:49:05,014 INFO L225 Difference]: With dead ends: 291 [2024-11-04 20:49:05,014 INFO L226 Difference]: Without dead ends: 230 [2024-11-04 20:49:05,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2024-11-04 20:49:05,015 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 78 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:49:05,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 596 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-04 20:49:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-04 20:49:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 120. [2024-11-04 20:49:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 95 states have internal predecessors, (110), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-04 20:49:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2024-11-04 20:49:05,046 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 100 [2024-11-04 20:49:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:49:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2024-11-04 20:49:05,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 9 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-04 20:49:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2024-11-04 20:49:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:49:05,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:49:05,048 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1] [2024-11-04 20:49:05,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-04 20:49:05,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:49:05,248 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:49:05,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:49:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1798646180, now seen corresponding path program 1 times [2024-11-04 20:49:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:49:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299338820] [2024-11-04 20:49:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:49:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:49:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:49:05,251 INFO L229 MonitoredProcess]: Starting monitored process 18 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:49:05,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-04 20:49:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:49:05,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-04 20:49:05,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:49:05,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:49:05,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-04 20:49:05,805 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 8 treesize of output 1 [2024-11-04 20:49:05,824 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 8 treesize of output 1 [2024-11-04 20:49:05,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-04 20:49:05,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-04 20:49:05,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:49:05,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-04 20:49:05,983 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) (select .cse0 (_ bv24 64)))))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_7) .cse1 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64))))) is different from true [2024-11-04 20:49:07,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) (select .cse0 (_ bv24 64)))))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_7) .cse1 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| (_ BitVec 64))) (let ((.cse3 (bvadd (_ bv8 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse3)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse3))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) .cse4)))) is different from true [2024-11-04 20:49:08,440 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) (select .cse0 (_ bv24 64)))))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_7) .cse1 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| (_ BitVec 64))) (let ((.cse3 (bvadd (_ bv8 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse3)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse3))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv8 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (select .cse4 (_ bv24 64))) (= (_ bv0 64) (select .cse4 (_ bv8 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (let ((.cse7 (select .cse6 (_ bv24 64))) (.cse5 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (and (= (_ bv0 64) (select .cse5 (_ bv8 64))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| v_DerPreprocessor_7) .cse7 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv24 64) .cse7))) (= (_ bv0 64) (select .cse6 (_ bv8 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| v_DerPreprocessor_5) .cse7 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv24 64) (select .cse5 (_ bv24 64))) .cse5)))))))) is different from true [2024-11-04 20:49:23,898 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse14 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (and (= (_ bv0 64) (select .cse0 (_ bv8 64))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (.cse2 (select .cse3 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_5) .cse2 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (_ bv24 64) (select .cse1 (_ bv24 64))))) (= (_ bv0 64) (select .cse1 (_ bv8 64))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| v_DerPreprocessor_7) .cse2 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (_ bv24 64) .cse2) .cse3)) (= (_ bv0 64) (select .cse3 (_ bv8 64))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (_ bv8 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| (select .cse4 (_ bv24 64))) (= (_ bv0 64) (select .cse4 (_ bv8 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_5) .cse6 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) (select .cse5 (_ bv24 64)))))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| v_DerPreprocessor_7) .cse6 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64) .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (_ BitVec 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_48|) (_ bv24 64))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4| (_ BitVec 64))) (let ((.cse8 (bvadd (_ bv8 64) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_4|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse8)) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_4|) .cse8))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv8 64))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (select .cse9 (_ bv24 64))) (= (_ bv0 64) (select .cse9 (_ bv8 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| (_ BitVec 64))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (let ((.cse12 (select .cse11 (_ bv24 64))) (.cse10 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|))) (and (= (_ bv0 64) (select .cse10 (_ bv8 64))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| v_DerPreprocessor_7) .cse12 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv24 64) .cse12))) (= (_ bv0 64) (select .cse11 (_ bv8 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49| v_DerPreprocessor_5) .cse12 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_49|) (_ bv24 64) (select .cse10 (_ bv24 64))) .cse10))))))) (let ((.cse13 (select .cse0 (_ bv24 64)))) (or (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| .cse13) (and (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse14 (store (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_5) .cse13 v_DerPreprocessor_6) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (_ bv24 64) (select .cse14 (_ bv24 64))))) (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_7) .cse13 v_DerPreprocessor_8) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (_ bv24 64) .cse13)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| (_ BitVec 64))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| (select .cse15 (_ bv24 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (_ bv8 64))) (= (select .cse15 (_ bv8 64)) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| (_ BitVec 64))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (let ((.cse17 (select .cse16 (_ bv24 64))) (.cse18 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (exists ((v_DerPreprocessor_7 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_8 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| v_DerPreprocessor_7) .cse17 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (_ bv24 64) .cse17))) (= (_ bv0 64) (select .cse18 (_ bv8 64))) (exists ((v_DerPreprocessor_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_5 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| v_DerPreprocessor_5) .cse17 v_DerPreprocessor_6) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (_ bv24 64) (select .cse18 (_ bv24 64))) .cse18)) (= (select .cse16 (_ bv8 64)) (_ bv0 64))))))) (= (select .cse14 (_ bv8 64)) (_ bv0 64)))) is different from true