/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_front_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 20:46:26,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 20:46:26,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-04 20:46:26,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 20:46:26,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 20:46:26,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 20:46:26,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 20:46:26,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 20:46:26,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 20:46:26,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 20:46:26,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 20:46:26,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 20:46:26,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 20:46:26,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 20:46:26,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 20:46:26,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 20:46:26,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 20:46:26,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 20:46:26,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 20:46:26,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 20:46:26,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 20:46:26,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 20:46:26,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 20:46:26,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 20:46:26,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 20:46:26,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 20:46:26,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 20:46:26,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 20:46:26,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 20:46:26,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 20:46:26,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 20:46:26,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:26,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 20:46:26,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 20:46:26,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 20:46:26,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 20:46:26,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 20:46:26,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 20:46:26,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 20:46:26,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 20:46:26,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:26,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 20:46:26,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 20:46:26,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 20:46:26,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 20:46:26,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 20:46:26,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i [2024-11-04 20:46:28,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 20:46:28,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 20:46:28,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i [2024-11-04 20:46:28,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0520be8/94907edc20e24f98bad00216eea81864/FLAG3c6277274 [2024-11-04 20:46:28,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0520be8/94907edc20e24f98bad00216eea81864 [2024-11-04 20:46:28,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 20:46:28,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 20:46:28,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:28,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 20:46:28,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 20:46:28,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:28" (1/1) ... [2024-11-04 20:46:28,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f183852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:28, skipping insertion in model container [2024-11-04 20:46:28,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 08:46:28" (1/1) ... [2024-11-04 20:46:28,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:28,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2024-11-04 20:46:28,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2024-11-04 20:46:29,339 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,436 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,437 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,438 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,447 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,450 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,451 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,451 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,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:46:29,452 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,453 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,458 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,458 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,476 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,478 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,480 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,480 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,480 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,481 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,482 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,483 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,484 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,484 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,484 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:29,781 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,782 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,783 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,891 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:29,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:29,937 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-04 20:46:29,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 20:46:29,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2024-11-04 20:46:29,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2024-11-04 20:46:30,006 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,019 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,019 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,020 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,024 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,024 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,029 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,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:46:30,030 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,031 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,032 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,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:46:30,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:46:30,043 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,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:46:30,043 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,044 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,046 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,046 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,047 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,047 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,050 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,051 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,052 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,052 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,099 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,140 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-04 20:46:30,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:30,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 20:46:30,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2024-11-04 20:46:30,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2024-11-04 20:46:30,209 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,210 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,210 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,210 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,211 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,219 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,220 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,221 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,222 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,223 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,224 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,224 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,224 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-04 20:46:30,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 20:46:30,486 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-04 20:46:30,495 INFO L204 MainTranslator]: Completed translation [2024-11-04 20:46:30,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30 WrapperNode [2024-11-04 20:46:30,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 20:46:30,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:30,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 20:46:30,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 20:46:30,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,619 INFO L138 Inliner]: procedures = 687, calls = 1043, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 136 [2024-11-04 20:46:30,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 20:46:30,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 20:46:30,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 20:46:30,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 20:46:30,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,672 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 20, 5]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2024-11-04 20:46:30,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 20:46:30,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 20:46:30,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 20:46:30,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 20:46:30,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (1/1) ... [2024-11-04 20:46:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 20:46:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 20:46:30,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-04 20:46:30,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-04 20:46:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-04 20:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 20:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-04 20:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-04 20:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-04 20:46:30,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-04 20:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-04 20:46:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2024-11-04 20:46:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2024-11-04 20:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 20:46:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-04 20:46:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-04 20:46:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-04 20:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-04 20:46:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-04 20:46:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-04 20:46:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-04 20:46:31,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 20:46:31,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 20:46:31,457 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-04 20:46:31,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 20:46:31,477 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 20:46:31,477 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-04 20:46:31,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:31 BoogieIcfgContainer [2024-11-04 20:46:31,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 20:46:31,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 20:46:31,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 20:46:31,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 20:46:31,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 08:46:28" (1/3) ... [2024-11-04 20:46:31,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697d8063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:31, skipping insertion in model container [2024-11-04 20:46:31,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 08:46:30" (2/3) ... [2024-11-04 20:46:31,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697d8063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 08:46:31, skipping insertion in model container [2024-11-04 20:46:31,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 08:46:31" (3/3) ... [2024-11-04 20:46:31,487 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness_negated.i [2024-11-04 20:46:31,502 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 20:46:31,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 20:46:31,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 20:46:31,570 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;@3c70e10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 20:46:31,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 20:46:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-04 20:46:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-04 20:46:31,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:31,582 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:31,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1606468667, now seen corresponding path program 1 times [2024-11-04 20:46:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379820581] [2024-11-04 20:46:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:31,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:31,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-04 20:46:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:31,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-04 20:46:31,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-04 20:46:31,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-04 20:46:32,048 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:32,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379820581] [2024-11-04 20:46:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [379820581] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:46:32,049 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:46:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-04 20:46:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697912261] [2024-11-04 20:46:32,053 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-04 20:46:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-04 20:46:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:32,082 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-04 20:46:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:32,124 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-11-04 20:46:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-04 20:46:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-11-04 20:46:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:32,136 INFO L225 Difference]: With dead ends: 188 [2024-11-04 20:46:32,136 INFO L226 Difference]: Without dead ends: 93 [2024-11-04 20:46:32,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-04 20:46:32,145 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:32,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-04 20:46:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-04 20:46:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-04 20:46:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-11-04 20:46:32,191 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2024-11-04 20:46:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-11-04 20:46:32,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-04 20:46:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-11-04 20:46:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-04 20:46:32,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:32,195 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:32,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:32,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:32,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1607570691, now seen corresponding path program 1 times [2024-11-04 20:46:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:32,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1016648470] [2024-11-04 20:46:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:32,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:32,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:32,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-04 20:46:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:32,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-04 20:46:32,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:32,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-04 20:46:32,958 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1016648470] [2024-11-04 20:46:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1016648470] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:32,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-04 20:46:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271809726] [2024-11-04 20:46:32,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:32,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 20:46:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 20:46:32,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:32,965 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-04 20:46:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:33,054 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2024-11-04 20:46:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 20:46:33,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2024-11-04 20:46:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:33,057 INFO L225 Difference]: With dead ends: 169 [2024-11-04 20:46:33,058 INFO L226 Difference]: Without dead ends: 95 [2024-11-04 20:46:33,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-04 20:46:33,059 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:33,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-04 20:46:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-04 20:46:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-04 20:46:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-04 20:46:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-11-04 20:46:33,075 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2024-11-04 20:46:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:33,076 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-11-04 20:46:33,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-04 20:46:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-04 20:46:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-04 20:46:33,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:33,079 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:33,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-04 20:46:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:33,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:33,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -254868999, now seen corresponding path program 1 times [2024-11-04 20:46:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335063843] [2024-11-04 20:46:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:33,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:33,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:33,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-04 20:46:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:33,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-04 20:46:33,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-04 20:46:33,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-04 20:46:33,869 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335063843] [2024-11-04 20:46:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1335063843] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:33,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-11-04 20:46:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918963500] [2024-11-04 20:46:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:46:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:46:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:33,871 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:34,100 INFO L93 Difference]: Finished difference Result 176 states and 233 transitions. [2024-11-04 20:46:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:46:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2024-11-04 20:46:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:34,106 INFO L225 Difference]: With dead ends: 176 [2024-11-04 20:46:34,106 INFO L226 Difference]: Without dead ends: 97 [2024-11-04 20:46:34,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-04 20:46:34,111 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:34,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 681 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-04 20:46:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-04 20:46:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-04 20:46:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2024-11-04 20:46:34,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2024-11-04 20:46:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:34,138 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2024-11-04 20:46:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2024-11-04 20:46:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-04 20:46:34,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:34,144 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:34,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:34,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:34,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:34,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2045206106, now seen corresponding path program 1 times [2024-11-04 20:46:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:34,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653312575] [2024-11-04 20:46:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:34,347 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:34,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-04 20:46:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:34,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-04 20:46:34,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-04 20:46:34,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-04 20:46:34,940 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653312575] [2024-11-04 20:46:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1653312575] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-11-04 20:46:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187124696] [2024-11-04 20:46:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-04 20:46:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-04 20:46:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-04 20:46:34,942 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:35,186 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2024-11-04 20:46:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-04 20:46:35,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2024-11-04 20:46:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:35,189 INFO L225 Difference]: With dead ends: 182 [2024-11-04 20:46:35,189 INFO L226 Difference]: Without dead ends: 102 [2024-11-04 20:46:35,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-04 20:46:35,194 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:35,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 765 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-04 20:46:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-04 20:46:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-04 20:46:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2024-11-04 20:46:35,210 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2024-11-04 20:46:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:35,211 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2024-11-04 20:46:35,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-04 20:46:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-04 20:46:35,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:35,213 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:35,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-04 20:46:35,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:35,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:35,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash -708361508, now seen corresponding path program 1 times [2024-11-04 20:46:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849408764] [2024-11-04 20:46:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:35,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:35,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:35,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:35,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-04 20:46:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:35,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-04 20:46:35,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:35,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-04 20:46:35,808 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849408764] [2024-11-04 20:46:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849408764] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3] total 9 [2024-11-04 20:46:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093385759] [2024-11-04 20:46:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 20:46:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 20:46:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-04 20:46:35,811 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:36,015 INFO L93 Difference]: Finished difference Result 179 states and 238 transitions. [2024-11-04 20:46:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-04 20:46:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2024-11-04 20:46:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:36,018 INFO L225 Difference]: With dead ends: 179 [2024-11-04 20:46:36,018 INFO L226 Difference]: Without dead ends: 102 [2024-11-04 20:46:36,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-04 20:46:36,022 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 34 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:36,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 657 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-04 20:46:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-04 20:46:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-04 20:46:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-04 20:46:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2024-11-04 20:46:36,041 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2024-11-04 20:46:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:36,042 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2024-11-04 20:46:36,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-04 20:46:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2024-11-04 20:46:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-04 20:46:36,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:36,044 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:36,050 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:46:36,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:36,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:36,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1326114882, now seen corresponding path program 1 times [2024-11-04 20:46:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128231562] [2024-11-04 20:46:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:36,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:36,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-04 20:46:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:36,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-04 20:46:36,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-04 20:46:36,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-04 20:46:36,736 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128231562] [2024-11-04 20:46:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1128231562] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:36,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:36,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-04 20:46:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047875201] [2024-11-04 20:46:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-04 20:46:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-04 20:46:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:36,739 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-04 20:46:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:36,801 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2024-11-04 20:46:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-04 20:46:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-11-04 20:46:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:36,803 INFO L225 Difference]: With dead ends: 178 [2024-11-04 20:46:36,803 INFO L226 Difference]: Without dead ends: 100 [2024-11-04 20:46:36,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-04 20:46:36,804 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:36,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-04 20:46:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-04 20:46:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-04 20:46:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-11-04 20:46:36,825 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2024-11-04 20:46:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-11-04 20:46:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-04 20:46:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-11-04 20:46:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-04 20:46:36,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:36,829 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:36,839 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:46:37,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:37,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:37,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash -720348629, now seen corresponding path program 1 times [2024-11-04 20:46:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:37,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980328111] [2024-11-04 20:46:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:37,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:37,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:37,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:37,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-04 20:46:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:37,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-04 20:46:37,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:37,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:38,321 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-04 20:46:38,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-11-04 20:46:38,338 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-04 20:46:38,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2024-11-04 20:46:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-04 20:46:38,360 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980328111] [2024-11-04 20:46:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1980328111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:46:38,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:46:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 18 [2024-11-04 20:46:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62892000] [2024-11-04 20:46:38,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:46:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-04 20:46:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-04 20:46:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-04 20:46:38,362 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 18 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-04 20:46:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:39,525 INFO L93 Difference]: Finished difference Result 202 states and 274 transitions. [2024-11-04 20:46:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-04 20:46:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 99 [2024-11-04 20:46:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:39,528 INFO L225 Difference]: With dead ends: 202 [2024-11-04 20:46:39,528 INFO L226 Difference]: Without dead ends: 123 [2024-11-04 20:46:39,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2024-11-04 20:46:39,531 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 78 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:39,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1280 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-04 20:46:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-04 20:46:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2024-11-04 20:46:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-04 20:46:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2024-11-04 20:46:39,551 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 99 [2024-11-04 20:46:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2024-11-04 20:46:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-04 20:46:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2024-11-04 20:46:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-04 20:46:39,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:39,553 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:39,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-04 20:46:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:39,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1218813417, now seen corresponding path program 1 times [2024-11-04 20:46:39,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:39,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775181218] [2024-11-04 20:46:39,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:39,756 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-04 20:46:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:39,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-04 20:46:39,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:39,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-04 20:46:40,084 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775181218] [2024-11-04 20:46:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [775181218] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-04 20:46:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-04 20:46:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-04 20:46:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597792754] [2024-11-04 20:46:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-04 20:46:40,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-04 20:46:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-04 20:46:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-04 20:46:40,086 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-04 20:46:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:46:40,139 INFO L93 Difference]: Finished difference Result 186 states and 249 transitions. [2024-11-04 20:46:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-04 20:46:40,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-04 20:46:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:46:40,142 INFO L225 Difference]: With dead ends: 186 [2024-11-04 20:46:40,142 INFO L226 Difference]: Without dead ends: 102 [2024-11-04 20:46:40,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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:46:40,144 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-04 20:46:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 20:46:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-04 20:46:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-04 20:46:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-04 20:46:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2024-11-04 20:46:40,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 99 [2024-11-04 20:46:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:46:40,165 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2024-11-04 20:46:40,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-04 20:46:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2024-11-04 20:46:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:46:40,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:46:40,166 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:46:40,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-04 20:46:40,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:46:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:46:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1707514615, now seen corresponding path program 1 times [2024-11-04 20:46:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:46:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821003397] [2024-11-04 20:46:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:46:40,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:46:40,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:46:40,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 20:46:40,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-04 20:46:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:46:40,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-04 20:46:40,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:46:40,957 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-04 20:46:40,957 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 1 case distinctions, treesize of input 22 treesize of output 19 [2024-11-04 20:46:40,973 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:46:41,004 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 11 [2024-11-04 20:46:41,017 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 39 treesize of output 22 [2024-11-04 20:46:41,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-04 20:46:41,025 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:46:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-04 20:46:42,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:46:44,127 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-04 20:46:44,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-04 20:46:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-04 20:46:44,236 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:46:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821003397] [2024-11-04 20:46:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [821003397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 20:46:44,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 20:46:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2024-11-04 20:46:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250565736] [2024-11-04 20:46:44,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 20:46:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-04 20:46:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:46:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-04 20:46:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-11-04 20:46:44,238 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 21 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 9 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-04 20:46:48,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:46:52,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:46:57,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:01,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-04 20:47:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:47:05,362 INFO L93 Difference]: Finished difference Result 237 states and 302 transitions. [2024-11-04 20:47:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-04 20:47:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 9 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 100 [2024-11-04 20:47:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:47:05,366 INFO L225 Difference]: With dead ends: 237 [2024-11-04 20:47:05,366 INFO L226 Difference]: Without dead ends: 158 [2024-11-04 20:47:05,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2024-11-04 20:47:05,367 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 152 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 78 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-04 20:47:05,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1302 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 819 Invalid, 4 Unknown, 0 Unchecked, 20.2s Time] [2024-11-04 20:47:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-04 20:47:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2024-11-04 20:47:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 109 states have internal predecessors, (131), 26 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (30), 26 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-04 20:47:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2024-11-04 20:47:05,385 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 100 [2024-11-04 20:47:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:47:05,385 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2024-11-04 20:47:05,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 9 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-04 20:47:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2024-11-04 20:47:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:47:05,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:47:05,387 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:47:05,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-04 20:47:05,587 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:47:05,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:47:05,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:47:05,588 INFO L85 PathProgramCache]: Analyzing trace with hash 898167989, now seen corresponding path program 1 times [2024-11-04 20:47:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:47:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37171234] [2024-11-04 20:47:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:47:05,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:05,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:47:05,590 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:47:05,591 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:47:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:47:05,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-04 20:47:05,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:47:06,068 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:47:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-04 20:47:06,089 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:47:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-04 20:47:08,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 20:47:13,643 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-04 20:47:13,644 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 94 treesize of output 103 [2024-11-04 20:47:13,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-04 20:47:13,691 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 95 treesize of output 97 [2024-11-04 20:47:13,709 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 68 treesize of output 64 [2024-11-04 20:47:14,030 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:47:14,061 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:47:14,124 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:47:14,163 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-04 20:47:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-04 20:47:14,573 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 20:47:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [37171234] [2024-11-04 20:47:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [37171234] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 20:47:14,573 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 20:47:14,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2024-11-04 20:47:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463492126] [2024-11-04 20:47:14,574 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 20:47:14,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-04 20:47:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 20:47:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-04 20:47:14,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-04 20:47:14,576 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-04 20:47:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 20:47:19,936 INFO L93 Difference]: Finished difference Result 454 states and 583 transitions. [2024-11-04 20:47:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-04 20:47:19,937 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 100 [2024-11-04 20:47:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 20:47:19,939 INFO L225 Difference]: With dead ends: 454 [2024-11-04 20:47:19,939 INFO L226 Difference]: Without dead ends: 300 [2024-11-04 20:47:19,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-11-04 20:47:19,941 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 183 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-04 20:47:19,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 867 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-04 20:47:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-04 20:47:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 169. [2024-11-04 20:47:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 125 states have internal predecessors, (147), 29 states have call successors, (29), 15 states have call predecessors, (29), 17 states have return successors, (33), 28 states have call predecessors, (33), 28 states have call successors, (33) [2024-11-04 20:47:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 209 transitions. [2024-11-04 20:47:19,963 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 209 transitions. Word has length 100 [2024-11-04 20:47:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 20:47:19,964 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 209 transitions. [2024-11-04 20:47:19,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-04 20:47:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2024-11-04 20:47:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-04 20:47:19,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 20:47:19,965 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-04 20:47:19,974 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:47:20,166 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:47:20,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 20:47:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 20:47:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash 505140979, now seen corresponding path program 1 times [2024-11-04 20:47:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 20:47:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269321983] [2024-11-04 20:47:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 20:47:20,167 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 20:47:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 20:47:20,168 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:47:20,169 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:47:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 20:47:20,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-04 20:47:20,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 20:47:20,782 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-04 20:47:20,783 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 1 case distinctions, treesize of input 22 treesize of output 19 [2024-11-04 20:47:20,813 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:47:20,836 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 11 [2024-11-04 20:47:21,408 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) is different from true [2024-11-04 20:47:21,876 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|))) (let ((.cse4 (select .cse3 (_ bv24 64)))) (or (= (_ bv16 64) (select .cse3 .cse4)) (= (_ bv24 64) .cse4) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (and (= (select v_DerPreprocessor_2 .cse4) (_ bv16 64)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) (_ bv24 64) .cse4))))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|)) is different from true [2024-11-04 20:47:24,658 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64)))))))) is different from true [2024-11-04 20:47:29,908 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64))))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| c_aws_linked_list_front_~list.base))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (or (= (_ bv24 64) .cse6) (= (_ bv16 64) (select .cse7 .cse6)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (and (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.offset| c_aws_linked_list_front_~list.base v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) c_aws_linked_list_front_~list.base) (_ bv24 64) .cse6)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse6))))))) (= (_ bv0 64) c_aws_linked_list_front_~list.offset)) is different from true [2024-11-04 20:47:34,046 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64)) (_ bv24 64))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse7 (select .cse6 (_ bv24 64)))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64) .cse7)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse7)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (_ bv16 64) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (select .cse8 (select .cse8 (_ bv24 64)))))))) is different from true [2024-11-04 20:47:34,186 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64))))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64)) (_ bv24 64))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse7 (select .cse6 (_ bv24 64)))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64) .cse7)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse7)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (_ bv16 64) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (select .cse8 (select .cse8 (_ bv24 64)))))))) is different from true [2024-11-04 20:47:41,251 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse6 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse7 (select .cse6 (_ bv24 64)))) (and (= (_ bv16 64) (select v_DerPreprocessor_2 .cse7)) (= (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv24 64) .cse7) .cse6))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse8 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (= (_ bv24 64) (select .cse8 (_ bv24 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse9 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (= (_ bv16 64) (select .cse9 (select .cse9 (_ bv24 64)))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64)) (_ bv24 64))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse11 (select .cse10 (_ bv24 64)))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64) .cse11)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse11)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (_ bv16 64) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (select .cse12 (select .cse12 (_ bv24 64)))))))) is different from true [2024-11-04 20:47:42,017 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| c_aws_linked_list_front_~list.base))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (select .cse0 (select .cse0 (_ bv24 64)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_34|) (_ bv24 64) .cse1) .cse2) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse1))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv24 64) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|) (_ bv24 64) .cse3) .cse4) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35| (_ BitVec 64))) (= (_ bv16 64) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_35|))) (select .cse5 (select .cse5 (_ bv24 64))))))) (= (_ bv0 64) (select .cse6 (_ bv8 64))) (let ((.cse7 (select .cse6 (_ bv24 64)))) (or (= (_ bv24 64) .cse7) (= (_ bv16 64) (select .cse6 .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.offset| c_aws_linked_list_front_~list.base v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) c_aws_linked_list_front_~list.base) (_ bv24 64) .cse7)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse7)))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| c_aws_linked_list_front_~list.base) (_ bv8 64))) (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse8 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse9 (select .cse8 (_ bv24 64)))) (and (= (_ bv16 64) (select v_DerPreprocessor_2 .cse9)) (= (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv24 64) .cse9) .cse8))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse10 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (= (_ bv24 64) (select .cse10 (_ bv24 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 (_ BitVec 64))) (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (and (= (_ bv0 64) (select .cse11 (_ bv8 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (_ bv8 64))) (= (_ bv16 64) (select .cse11 (select .cse11 (_ bv24 64)))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (select (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64)) (_ bv24 64))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64)) (v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| (_ BitVec 64))) (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse13 (select .cse12 (_ bv24 64)))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (_ bv24 64) .cse13)) (= (_ bv16 64) (select v_DerPreprocessor_2 .cse13)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 (_ BitVec 64))) (= (_ bv16 64) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (select .cse14 (select .cse14 (_ bv24 64))))))))) is different from true