./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_back_harness_negated.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_back_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5094ef48f22f1fe1203446e11fcea69068fe32fb7efd9beaaef32a9ae7a4548b --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:24:21,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:24:22,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:24:22,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:24:22,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:24:22,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:24:22,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:24:22,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:24:22,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:24:22,097 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:24:22,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:24:22,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:24:22,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:24:22,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:24:22,099 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:24:22,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:24:22,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:24:22,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:24:22,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:24:22,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:24:22,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:24:22,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:24:22,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:24:22,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:24:22,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:24:22,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:24:22,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:24:22,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:24:22,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:24:22,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:24:22,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:24:22,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:24:22,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:24:22,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:24:22,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5094ef48f22f1fe1203446e11fcea69068fe32fb7efd9beaaef32a9ae7a4548b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:24:22,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:24:22,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:24:22,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:24:22,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:24:22,453 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:24:22,454 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_back_harness_negated.i [2023-11-23 07:24:23,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:24:23,878 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:24:23,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_back_harness_negated.i [2023-11-23 07:24:23,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b93d9ec/21185a65209f46379748b5a4fb01b49d/FLAG00203b6e7 [2023-11-23 07:24:23,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b93d9ec/21185a65209f46379748b5a4fb01b49d [2023-11-23 07:24:23,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:24:23,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:24:23,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:24:23,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:24:23,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:24:23,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:24:23" (1/1) ... [2023-11-23 07:24:23,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c81b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:23, skipping insertion in model container [2023-11-23 07:24:23,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:24:23" (1/1) ... [2023-11-23 07:24:23,991 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:24:24,177 WARN L240 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_back_harness_negated.i[4494,4507] [2023-11-23 07:24:24,182 WARN L240 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_back_harness_negated.i[4554,4567] [2023-11-23 07:24:24,588 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,598 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,599 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,600 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,601 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,602 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,603 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,603 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,603 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:24:24,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:24:24,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:24:24,821 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:24:24,822 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:24:24,823 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:24:24,824 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:24:24,824 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:24:24,824 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:24:24,825 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:24:24,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:24:24,961 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:24:24,972 WARN L240 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_back_harness_negated.i[4494,4507] [2023-11-23 07:24:24,972 WARN L240 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_back_harness_negated.i[4554,4567] [2023-11-23 07:24:24,997 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,998 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,998 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,998 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:24,999 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,006 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,006 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,007 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,008 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,009 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,010 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,011 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,011 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:24:25,036 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:24:25,037 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:24:25,038 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:24:25,038 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:24:25,039 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:24:25,039 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:24:25,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:24:25,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:24:25,040 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:24:25,041 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:24:25,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:24:25,214 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,214 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,214 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,214 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,215 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,215 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,215 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,216 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,216 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,216 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,216 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,217 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,217 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,217 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,217 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,217 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:24:25,224 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:24:25,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25 WrapperNode [2023-11-23 07:24:25,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:24:25,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:24:25,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:24:25,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:24:25,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,327 INFO L138 Inliner]: procedures = 678, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2023-11-23 07:24:25,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:24:25,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:24:25,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:24:25,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:24:25,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,363 INFO L188 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-23 07:24:25,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:24:25,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:24:25,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:24:25,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:24:25,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (1/1) ... [2023-11-23 07:24:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:24:25,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:25,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:24:25,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:24:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2023-11-23 07:24:25,469 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2023-11-23 07:24:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:24:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:24:25,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:24:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:24:25,470 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:24:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:24:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:24:25,470 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:24:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:24:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:24:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:24:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:24:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:24:25,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:24:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:24:25,472 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:24:25,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:24:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:24:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:24:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:24:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:24:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:24:25,658 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:24:25,660 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:24:25,883 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:24:25,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:24:25,918 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:24:25,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:24:25 BoogieIcfgContainer [2023-11-23 07:24:25,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:24:25,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:24:25,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:24:25,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:24:25,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:24:23" (1/3) ... [2023-11-23 07:24:25,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:24:25, skipping insertion in model container [2023-11-23 07:24:25,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:25" (2/3) ... [2023-11-23 07:24:25,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:24:25, skipping insertion in model container [2023-11-23 07:24:25,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:24:25" (3/3) ... [2023-11-23 07:24:25,925 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2023-11-23 07:24:25,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:24:25,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:24:25,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:24:25,981 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b0e65a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:24:25,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:24:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 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) [2023-11-23 07:24:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:24:25,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:25,996 INFO L195 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] [2023-11-23 07:24:25,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:26,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2007491860, now seen corresponding path program 1 times [2023-11-23 07:24:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816780231] [2023-11-23 07:24:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:24:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:24:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:24:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:24:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:24:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 07:24:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:24:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:24:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816780231] [2023-11-23 07:24:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816780231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:24:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:24:26,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:24:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545871459] [2023-11-23 07:24:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:26,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:24:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:24:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:24:26,463 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:24:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:26,510 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-23 07:24:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:24:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-23 07:24:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:26,517 INFO L225 Difference]: With dead ends: 168 [2023-11-23 07:24:26,517 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 07:24:26,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:24:26,522 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:26,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:24:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 07:24:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-23 07:24:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 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) [2023-11-23 07:24:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-23 07:24:26,553 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-23 07:24:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:26,553 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-23 07:24:26,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:24:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-23 07:24:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:24:26,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:26,556 INFO L195 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] [2023-11-23 07:24:26,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:24:26,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:26,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash 117057108, now seen corresponding path program 1 times [2023-11-23 07:24:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807956689] [2023-11-23 07:24:26,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:24:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:24:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:24:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:24:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:24:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 07:24:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:24:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 07:24:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807956689] [2023-11-23 07:24:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807956689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406875466] [2023-11-23 07:24:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:27,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:27,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:27,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:24:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:27,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 07:24:27,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:27,393 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 16 treesize of output 17 [2023-11-23 07:24:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:24:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:24:28,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:24:35,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2023-11-23 07:24:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:35,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:35,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2023-11-23 07:24:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:24:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406875466] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:24:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 16] total 33 [2023-11-23 07:24:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011622295] [2023-11-23 07:24:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:24:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:24:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=949, Unknown=3, NotChecked=0, Total=1056 [2023-11-23 07:24:35,602 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:24:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:36,074 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2023-11-23 07:24:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:24:36,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 79 [2023-11-23 07:24:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:36,078 INFO L225 Difference]: With dead ends: 155 [2023-11-23 07:24:36,078 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 07:24:36,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=124, Invalid=1205, Unknown=3, NotChecked=0, Total=1332 [2023-11-23 07:24:36,084 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:36,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1150 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:24:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 07:24:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 07:24:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 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) [2023-11-23 07:24:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2023-11-23 07:24:36,095 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 79 [2023-11-23 07:24:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:36,095 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2023-11-23 07:24:36,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:24:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2023-11-23 07:24:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:24:36,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:36,097 INFO L195 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] [2023-11-23 07:24:36,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:24:36,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:36,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:36,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 165686469, now seen corresponding path program 1 times [2023-11-23 07:24:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:36,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918376849] [2023-11-23 07:24:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:24:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:24:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:24:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:24:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 07:24:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918376849] [2023-11-23 07:24:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918376849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205346246] [2023-11-23 07:24:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:36,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:36,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:36,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:24:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:36,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:24:36,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:36,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 07:24:36,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:24:36,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 07:24:36,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 07:24:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-23 07:24:36,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:24:36,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:24:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:24:36,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:24:36,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 07:24:36,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:24:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:36,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-23 07:24:36,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:24:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:24:38,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:24:38,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_213))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_210 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_210))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:24:38,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:38,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:38,817 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:24:38,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 299 treesize of output 286 [2023-11-23 07:24:38,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:38,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:38,977 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:24:38,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 232 [2023-11-23 07:24:38,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:24:38,993 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 262 treesize of output 260 [2023-11-23 07:24:39,005 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 219 treesize of output 207 [2023-11-23 07:24:39,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:24:39,023 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 308 treesize of output 306 [2023-11-23 07:24:39,034 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 265 treesize of output 253 [2023-11-23 07:24:39,102 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 [2023-11-23 07:24:39,935 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 [2023-11-23 07:24:40,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:24:40,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 904 treesize of output 870 [2023-11-23 07:24:41,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:24:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1287 treesize of output 1197 [2023-11-23 07:24:43,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205346246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:43,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:24:43,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 17 [2023-11-23 07:24:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984863341] [2023-11-23 07:24:43,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:24:43,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:24:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:24:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=529, Unknown=2, NotChecked=46, Total=650 [2023-11-23 07:24:43,874 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-23 07:24:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:44,981 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2023-11-23 07:24:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 07:24:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 80 [2023-11-23 07:24:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:44,984 INFO L225 Difference]: With dead ends: 166 [2023-11-23 07:24:44,984 INFO L226 Difference]: Without dead ends: 93 [2023-11-23 07:24:44,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 142 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=187, Invalid=1297, Unknown=2, NotChecked=74, Total=1560 [2023-11-23 07:24:44,986 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 143 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:44,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 649 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:24:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-23 07:24:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-23 07:24:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 60 states have internal predecessors, (73), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 07:24:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2023-11-23 07:24:44,997 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 80 [2023-11-23 07:24:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:44,997 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2023-11-23 07:24:44,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-23 07:24:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2023-11-23 07:24:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 07:24:44,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:44,999 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:24:45,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:24:45,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 07:24:45,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:45,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1381993145, now seen corresponding path program 1 times [2023-11-23 07:24:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532149812] [2023-11-23 07:24:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:24:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:24:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 07:24:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:24:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 07:24:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532149812] [2023-11-23 07:24:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532149812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125715422] [2023-11-23 07:24:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:45,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:45,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:24:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:45,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:24:45,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:24:45,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:24:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125715422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:24:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:24:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-23 07:24:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593067176] [2023-11-23 07:24:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:24:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:24:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:24:45,699 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2023-11-23 07:24:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:45,830 INFO L93 Difference]: Finished difference Result 169 states and 225 transitions. [2023-11-23 07:24:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:24:45,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 82 [2023-11-23 07:24:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:45,833 INFO L225 Difference]: With dead ends: 169 [2023-11-23 07:24:45,834 INFO L226 Difference]: Without dead ends: 93 [2023-11-23 07:24:45,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:24:45,835 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 42 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:45,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 566 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:24:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-23 07:24:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-23 07:24:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 60 states have internal predecessors, (72), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 07:24:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2023-11-23 07:24:45,866 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 82 [2023-11-23 07:24:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:45,866 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2023-11-23 07:24:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2023-11-23 07:24:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2023-11-23 07:24:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:24:45,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:45,868 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:24:45,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 07:24:46,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:46,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:46,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash -322391750, now seen corresponding path program 1 times [2023-11-23 07:24:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691664265] [2023-11-23 07:24:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:24:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:24:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:24:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:24:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 07:24:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691664265] [2023-11-23 07:24:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691664265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068699671] [2023-11-23 07:24:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:46,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:46,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:24:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:46,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:24:46,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:24:46,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:24:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068699671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:24:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:24:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2023-11-23 07:24:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121223602] [2023-11-23 07:24:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:46,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:24:46,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:24:46,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:24:46,514 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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) [2023-11-23 07:24:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:46,679 INFO L93 Difference]: Finished difference Result 176 states and 234 transitions. [2023-11-23 07:24:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:24:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 84 [2023-11-23 07:24:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:46,680 INFO L225 Difference]: With dead ends: 176 [2023-11-23 07:24:46,680 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 07:24:46,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-11-23 07:24:46,681 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 64 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:46,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 635 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:24:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 07:24:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-11-23 07:24:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 61 states have internal predecessors, (73), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 07:24:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2023-11-23 07:24:46,690 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 84 [2023-11-23 07:24:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:46,691 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2023-11-23 07:24:46,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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) [2023-11-23 07:24:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2023-11-23 07:24:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-23 07:24:46,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:46,692 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:24:46,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:24:46,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:46,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:46,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -589887762, now seen corresponding path program 1 times [2023-11-23 07:24:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709362015] [2023-11-23 07:24:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:24:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:24:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:24:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 07:24:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-23 07:24:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709362015] [2023-11-23 07:24:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709362015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021398914] [2023-11-23 07:24:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:47,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:47,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:47,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:24:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:24:47,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:24:47,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:24:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021398914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:24:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:24:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 07:24:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67877618] [2023-11-23 07:24:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:47,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:24:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:24:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:24:47,288 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-11-23 07:24:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:47,319 INFO L93 Difference]: Finished difference Result 172 states and 230 transitions. [2023-11-23 07:24:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:24:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 85 [2023-11-23 07:24:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:47,320 INFO L225 Difference]: With dead ends: 172 [2023-11-23 07:24:47,324 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 07:24:47,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:24:47,325 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:47,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 199 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:24:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 07:24:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2023-11-23 07:24:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 62 states have internal predecessors, (74), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 07:24:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-11-23 07:24:47,349 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 85 [2023-11-23 07:24:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:47,350 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-11-23 07:24:47,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-11-23 07:24:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-11-23 07:24:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-23 07:24:47,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:47,351 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:24:47,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:24:47,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:47,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:47,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1160924749, now seen corresponding path program 1 times [2023-11-23 07:24:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420247274] [2023-11-23 07:24:47,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:24:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:24:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:24:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:24:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:24:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 07:24:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420247274] [2023-11-23 07:24:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420247274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400639064] [2023-11-23 07:24:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:47,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:47,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:47,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:47,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:24:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:47,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 07:24:47,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:48,012 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 07:24:48,012 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 07:24:48,017 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 16 treesize of output 15 [2023-11-23 07:24:48,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:48,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 07:24:48,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:24:48,052 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (= .cse0 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse0))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0))))))))) is different from true [2023-11-23 07:24:48,079 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse2))) (and (= v_DerPreprocessor_2 (store .cse0 .cse1 .cse2)) (= (select |c_#memory_$Pointer$#2.base| .cse2) .cse0)))) (not (= .cse2 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse3) (not (= .cse3 0)))))) is different from true [2023-11-23 07:24:48,159 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse2))) (and (= v_DerPreprocessor_2 (store .cse0 .cse1 .cse2)) (= (select |c_#memory_$Pointer$#2.base| .cse2) .cse0)))) (not (= .cse2 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse3) (not (= .cse3 0)))))) (not (= .cse4 0)) (or (= .cse4 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse4))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse4)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse4))))))))) is different from true [2023-11-23 07:24:48,180 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse6)) (= (select |c_#memory_$Pointer$#2.base| .cse6) .cse4)))) (not (= .cse6 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse7) (not (= .cse7 0))))))) is different from true [2023-11-23 07:24:48,264 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse6)) (= (select |c_#memory_$Pointer$#2.base| .cse6) .cse4)))) (not (= .cse6 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse7) (not (= .cse7 0)))))) (not (= .cse8 0)) (or (= .cse8 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= .cse9 (select |c_#memory_$Pointer$#2.base| .cse8))))))))) is different from true [2023-11-23 07:24:48,323 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_aws_linked_list_back_#in~list.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_back_#in~list.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (not (= .cse4 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= (select |c_#memory_$Pointer$#2.base| .cse7) .cse5)))) (not (= .cse7 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse8) (not (= .cse8 0)))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |c_aws_linked_list_back_#in~list.base| v_DerPreprocessor_2) .cse4))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse4)) (= (select |c_#memory_$Pointer$#2.base| .cse4) .cse9)))) (= |c_aws_linked_list_back_#in~list.base| .cse4))))) is different from true [2023-11-23 07:24:48,355 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_aws_linked_list_back_~list.offset 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (or (= .cse4 c_aws_linked_list_back_~list.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) c_aws_linked_list_back_~list.base v_DerPreprocessor_2) .cse4))) (and (= (select |c_#memory_$Pointer$#2.base| .cse4) .cse5) (= (store .cse5 .cse6 .cse4) v_DerPreprocessor_2))))) (not (= .cse4 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse9))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse9)) (= (select |c_#memory_$Pointer$#2.base| .cse9) .cse7)))) (not (= .cse9 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse10) (not (= .cse10 0))))))))) is different from true [2023-11-23 07:24:48,389 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse6)) (= (select |c_#memory_$Pointer$#2.base| .cse6) .cse4)))) (not (= .cse6 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse7) (not (= .cse7 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse9 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse10))) (and (= v_DerPreprocessor_2 (store .cse8 .cse9 .cse10)) (= (select |c_#memory_$Pointer$#2.base| .cse10) .cse8)))) (not (= .cse10 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse11) (not (= .cse11 0))))))) is different from true [2023-11-23 07:24:49,066 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_aws_linked_list_back_~list.offset 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse3)) (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse3))))) (not (= .cse3 0))))))) (or (= .cse4 c_aws_linked_list_back_~list.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) c_aws_linked_list_back_~list.base v_DerPreprocessor_2) .cse4))) (and (= (select |c_#memory_$Pointer$#2.base| .cse4) .cse5) (= (store .cse5 .cse6 .cse4) v_DerPreprocessor_2))))) (not (= .cse4 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse9))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse9)) (= (select |c_#memory_$Pointer$#2.base| .cse9) .cse7)))) (not (= .cse9 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse10) (not (= .cse10 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse12 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse12))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse13))) (and (= v_DerPreprocessor_2 (store .cse11 .cse12 .cse13)) (= (select |c_#memory_$Pointer$#2.base| .cse13) .cse11)))) (not (= .cse13 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse14) (not (= .cse14 0))))))))) is different from true [2023-11-23 07:24:49,118 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse9))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse10))) (and (= v_DerPreprocessor_2 (store .cse8 .cse9 .cse10)) (= (select |c_#memory_$Pointer$#2.base| .cse10) .cse8)))) (not (= .cse10 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse11) (not (= .cse11 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse13 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse14))) (and (= v_DerPreprocessor_2 (store .cse12 .cse13 .cse14)) (= (select |c_#memory_$Pointer$#2.base| .cse14) .cse12)))) (not (= .cse14 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse15) (not (= .cse15 0))))))) is different from true [2023-11-23 07:24:49,300 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_aws_linked_list_back_~list.offset 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base) .cse10))) (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (= .cse8 c_aws_linked_list_back_~list.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) c_aws_linked_list_back_~list.base v_DerPreprocessor_2) .cse8))) (and (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9) (= (store .cse9 .cse10 .cse8) v_DerPreprocessor_2))))) (not (= .cse8 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse12))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse13))) (and (= v_DerPreprocessor_2 (store .cse11 .cse12 .cse13)) (= (select |c_#memory_$Pointer$#2.base| .cse13) .cse11)))) (not (= .cse13 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse14) (not (= .cse14 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse16 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse16))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse17))) (and (= v_DerPreprocessor_2 (store .cse15 .cse16 .cse17)) (= (select |c_#memory_$Pointer$#2.base| .cse17) .cse15)))) (not (= .cse17 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse18) (not (= .cse18 0))))))))) is different from true [2023-11-23 07:24:49,391 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse8))) (and (= .cse9 (select |c_#memory_$Pointer$#2.base| .cse8)) (= (store .cse9 .cse10 .cse8) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse14))) (and (= v_DerPreprocessor_2 (store .cse12 .cse13 .cse14)) (= (select |c_#memory_$Pointer$#2.base| .cse14) .cse12)))) (not (= .cse14 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse15) (not (= .cse15 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse17 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse17))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse18))) (and (= v_DerPreprocessor_2 (store .cse16 .cse17 .cse18)) (= (select |c_#memory_$Pointer$#2.base| .cse18) .cse16)))) (not (= .cse18 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse19) (not (= .cse19 0))))))) is different from true [2023-11-23 07:24:49,716 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_aws_linked_list_back_~list.offset 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base) .cse10))) (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (= .cse8 c_aws_linked_list_back_~list.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) c_aws_linked_list_back_~list.base v_DerPreprocessor_2) .cse8))) (and (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9) (= (store .cse9 .cse10 .cse8) v_DerPreprocessor_2))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse13 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse13))) (and (not (= .cse11 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse11))) (and (= .cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (= (store .cse12 .cse13 .cse11) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse14 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse14))))) (not (= .cse8 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse16 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse16))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse17))) (and (= v_DerPreprocessor_2 (store .cse15 .cse16 .cse17)) (= (select |c_#memory_$Pointer$#2.base| .cse17) .cse15)))) (not (= .cse17 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse18) (not (= .cse18 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse20 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse21))) (and (= v_DerPreprocessor_2 (store .cse19 .cse20 .cse21)) (= (select |c_#memory_$Pointer$#2.base| .cse21) .cse19)))) (not (= .cse21 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse22) (not (= .cse22 0))))))))) is different from true [2023-11-23 07:24:49,772 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse8))) (and (= .cse9 (select |c_#memory_$Pointer$#2.base| .cse8)) (= (store .cse9 .cse10 .cse8) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse11))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse12 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse12)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse15))) (and (= (store .cse13 .cse14 .cse15) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse15) .cse13)))) (not (= .cse15 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse17))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse18))) (and (= v_DerPreprocessor_2 (store .cse16 .cse17 .cse18)) (= (select |c_#memory_$Pointer$#2.base| .cse18) .cse16)))) (not (= .cse18 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse19) (not (= .cse19 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse21 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse23) (not (= .cse23 0))))))) is different from true [2023-11-23 07:24:49,994 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_aws_linked_list_back_~list.offset 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base) .cse10))) (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (= .cse8 c_aws_linked_list_back_~list.base) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) c_aws_linked_list_back_~list.base v_DerPreprocessor_2) .cse8))) (and (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9) (= (store .cse9 .cse10 .cse8) v_DerPreprocessor_2))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse13 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse13))) (and (not (= .cse11 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse11))) (and (= .cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (= (store .cse12 .cse13 .cse11) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse14 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse14))))) (not (= .cse8 0)) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse15)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse17 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse17))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse18))) (and (= (store .cse16 .cse17 .cse18) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse18) .cse16)))) (not (= .cse18 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse20 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse20))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse21))) (and (= v_DerPreprocessor_2 (store .cse19 .cse20 .cse21)) (= (select |c_#memory_$Pointer$#2.base| .cse21) .cse19)))) (not (= .cse21 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse22) (not (= .cse22 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse24 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse25))) (and (= v_DerPreprocessor_2 (store .cse23 .cse24 .cse25)) (= (select |c_#memory_$Pointer$#2.base| .cse25) .cse23)))) (not (= .cse25 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse26) (not (= .cse26 0))))))))) is different from true [2023-11-23 07:24:50,178 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_23 v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_23 .cse11))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse12))) (and (= .cse13 (select |c_#memory_$Pointer$#2.base| .cse12)) (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse15))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse16 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse16)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse18 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse18))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse19))) (and (= (store .cse17 .cse18 .cse19) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse19) .cse17)))) (not (= .cse19 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse23) (not (= .cse23 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse25 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse25))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse26))) (and (= v_DerPreprocessor_2 (store .cse24 .cse25 .cse26)) (= (select |c_#memory_$Pointer$#2.base| .cse26) .cse24)))) (not (= .cse26 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse27) (not (= .cse27 0))))))) is different from true [2023-11-23 07:24:50,278 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_23 v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_23 .cse11))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse12))) (and (= .cse13 (select |c_#memory_$Pointer$#2.base| .cse12)) (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse15))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse16 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse16)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse18 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse18))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse19))) (and (= (store .cse17 .cse18 .cse19) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse19) .cse17)))) (not (= .cse19 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse23) (not (= .cse23 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse25 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse25))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse26))) (and (= v_DerPreprocessor_2 (store .cse24 .cse25 .cse26)) (= (select |c_#memory_$Pointer$#2.base| .cse26) .cse24)))) (not (= .cse26 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse27) (not (= .cse27 0))))))) is different from true [2023-11-23 07:24:50,674 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_23 v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_23 .cse11))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse12))) (and (= .cse13 (select |c_#memory_$Pointer$#2.base| .cse12)) (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse15))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse16 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse16)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse18 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse18))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse19))) (and (= (store .cse17 .cse18 .cse19) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse19) .cse17)))) (not (= .cse19 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse23) (not (= .cse23 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse25 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse25))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse26))) (and (= v_DerPreprocessor_2 (store .cse24 .cse25 .cse26)) (= (select |c_#memory_$Pointer$#2.base| .cse26) .cse24)))) (not (= .cse26 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse27) (not (= .cse27 0))))))) is different from true [2023-11-23 07:24:50,752 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or |c_aws_linked_list_is_valid_#t~short312#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_23 v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_23 .cse11))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse12))) (and (= .cse13 (select |c_#memory_$Pointer$#2.base| .cse12)) (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse15))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse16 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse16)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse18 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse18))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse19))) (and (= (store .cse17 .cse18 .cse19) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse19) .cse17)))) (not (= .cse19 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse23) (not (= .cse23 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse25 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse25))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse26))) (and (= v_DerPreprocessor_2 (store .cse24 .cse25 .cse26)) (= (select |c_#memory_$Pointer$#2.base| .cse26) .cse24)))) (not (= .cse26 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse27) (not (= .cse27 0))))))) is different from true [2023-11-23 07:24:50,835 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_20 .cse0) (not (= .cse0 0))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_20 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 Int)) (let ((.cse2 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_18 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_20) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_20 v_DerPreprocessor_2) .cse3))) (and (= (store .cse1 .cse2 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse1)))) (not (= .cse3 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_2) .cse7))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse7)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse7))))) (not (= .cse7 0))))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse10 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_23 v_DerPreprocessor_2) .cse8))) (and (= v_DerPreprocessor_2 (store .cse9 .cse10 .cse8)) (= (select |c_#memory_$Pointer$#2.base| .cse8) .cse9)))))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_21 24)))) (and (not (= .cse11 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_23 .cse11))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse14 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_21 v_DerPreprocessor_2) .cse12))) (and (= .cse13 (select |c_#memory_$Pointer$#2.base| .cse12)) (= (store .cse13 .cse14 .cse12) v_DerPreprocessor_2)))))))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_19 24)))) (and (not (= .cse15 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_21 .cse15))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24)))) (and (not (= .cse16 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_22 .cse16)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 Int)) (let ((.cse18 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_20 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) .cse18))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_22 v_DerPreprocessor_2) .cse19))) (and (= (store .cse17 .cse18 .cse19) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse19) .cse17)))) (not (= .cse19 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse22 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) .cse21))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| v_DerPreprocessor_2) .cse22))) (and (= v_DerPreprocessor_2 (store .cse20 .cse21 .cse22)) (= (select |c_#memory_$Pointer$#2.base| .cse22) .cse20)))) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_29| .cse23) (not (= .cse23 0)))))) (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse25 (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24))) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) .cse25))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_1) v_aws_linked_list_back_~list.base_BEFORE_CALL_19 v_DerPreprocessor_2) .cse26))) (and (= v_DerPreprocessor_2 (store .cse24 .cse25 .cse26)) (= (select |c_#memory_$Pointer$#2.base| .cse26) .cse24)))) (not (= .cse26 0)))))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 Int) (v_aws_linked_list_back_~list.base_BEFORE_CALL_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_19) (+ v_aws_linked_list_back_~list.offset_BEFORE_CALL_17 24)))) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_19 .cse27) (not (= .cse27 0)))))) (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) is different from true [2023-11-23 07:24:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-23 07:24:50,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:24:51,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:24:51,144 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 162 treesize of output 163 [2023-11-23 07:24:51,148 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 172 treesize of output 156 [2023-11-23 07:24:51,193 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 [2023-11-23 07:24:51,195 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 [2023-11-23 07:24:51,207 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 [2023-11-23 07:24:51,213 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:24:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 07:24:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400639064] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:24:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 24] total 36 [2023-11-23 07:24:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102010878] [2023-11-23 07:24:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:24:51,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:24:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:24:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:24:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=227, Unknown=20, NotChecked=940, Total=1260 [2023-11-23 07:24:51,244 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:24:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:24:51,556 INFO L93 Difference]: Finished difference Result 187 states and 248 transitions. [2023-11-23 07:24:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:24:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 92 [2023-11-23 07:24:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:24:51,557 INFO L225 Difference]: With dead ends: 187 [2023-11-23 07:24:51,557 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 07:24:51,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=313, Unknown=20, NotChecked=1060, Total=1482 [2023-11-23 07:24:51,558 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:24:51,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 536 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:24:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 07:24:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-11-23 07:24:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 07:24:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2023-11-23 07:24:51,567 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 92 [2023-11-23 07:24:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:24:51,567 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2023-11-23 07:24:51,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:24:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2023-11-23 07:24:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-23 07:24:51,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:24:51,568 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2023-11-23 07:24:51,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:24:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:51,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:24:51,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:24:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1553951759, now seen corresponding path program 1 times [2023-11-23 07:24:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:24:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748386453] [2023-11-23 07:24:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:24:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:24:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:24:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:24:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:24:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:24:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:24:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:24:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:24:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:24:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:24:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 07:24:52,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:24:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748386453] [2023-11-23 07:24:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748386453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:24:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630267459] [2023-11-23 07:24:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:24:52,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:24:52,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:24:52,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:24:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:24:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:24:52,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-23 07:24:52,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:24:52,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 07:24:52,434 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 27 treesize of output 15 [2023-11-23 07:24:52,443 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 27 treesize of output 15 [2023-11-23 07:24:52,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 07:24:52,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-23 07:24:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:52,524 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-23 07:24:52,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 89 [2023-11-23 07:24:52,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:52,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:52,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 40 [2023-11-23 07:24:54,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:54,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:54,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:54,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:24:54,165 INFO L349 Elim1Store]: treesize reduction 124, result has 0.8 percent of original size [2023-11-23 07:24:54,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 34 case distinctions, treesize of input 168 treesize of output 1 [2023-11-23 07:24:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:24:54,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:24:55,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:56,016 INFO L349 Elim1Store]: treesize reduction 2701, result has 25.4 percent of original size [2023-11-23 07:24:56,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 1991901 treesize of output 1930363 [2023-11-23 07:24:58,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:58,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:58,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:58,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:24:58,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:25:08,934 WARN L293 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 1052 DAG size of output: 386 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 07:25:08,934 INFO L349 Elim1Store]: treesize reduction 3556, result has 23.9 percent of original size [2023-11-23 07:25:08,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 19 select indices, 19 select index equivalence classes, 9 disjoint index pairs (out of 171 index pairs), introduced 23 new quantified variables, introduced 212 case distinctions, treesize of input 1114280 treesize of output 1005545 [2023-11-23 07:25:29,288 WARN L293 SmtUtils]: Spent 20.34s on a formula simplification. DAG size of input: 3811 DAG size of output: 1904 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-23 07:25:31,668 INFO L349 Elim1Store]: treesize reduction 120, result has 45.9 percent of original size [2023-11-23 07:25:31,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 41794 treesize of output 41825 [2023-11-23 07:25:33,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:25:33,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 41653 treesize of output 41685 [2023-11-23 07:25:35,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:25:35,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44718 treesize of output 44658 [2023-11-23 07:27:43,778 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-23 07:27:43,779 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 07:27:43,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-23 07:27:43,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:43,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:43,981 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-23 07:27:43,987 INFO L158 Benchmark]: Toolchain (without parser) took 200062.13ms. Allocated memory was 241.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 206.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1298.08ms. Allocated memory is still 241.2MB. Free memory was 206.4MB in the beginning and 139.5MB in the end (delta: 66.9MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.95ms. Allocated memory is still 241.2MB. Free memory was 139.5MB in the beginning and 133.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: Boogie Preprocessor took 74.38ms. Allocated memory is still 241.2MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: RCFGBuilder took 515.73ms. Allocated memory is still 241.2MB. Free memory was 129.0MB in the beginning and 191.3MB in the end (delta: -62.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2023-11-23 07:27:43,987 INFO L158 Benchmark]: TraceAbstraction took 198066.74ms. Allocated memory was 241.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 191.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 07:27:43,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1298.08ms. Allocated memory is still 241.2MB. Free memory was 206.4MB in the beginning and 139.5MB in the end (delta: 66.9MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.95ms. Allocated memory is still 241.2MB. Free memory was 139.5MB in the beginning and 133.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.38ms. Allocated memory is still 241.2MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 515.73ms. Allocated memory is still 241.2MB. Free memory was 129.0MB in the beginning and 191.3MB in the end (delta: -62.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 198066.74ms. Allocated memory was 241.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 191.3MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_back_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5094ef48f22f1fe1203446e11fcea69068fe32fb7efd9beaaef32a9ae7a4548b --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:27:46,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:27:46,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 07:27:46,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:27:46,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:27:46,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:27:46,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:27:46,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:27:46,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:27:46,194 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:27:46,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:27:46,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:27:46,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:27:46,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:27:46,196 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:27:46,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:27:46,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:27:46,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:27:46,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:27:46,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:27:46,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:27:46,198 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 07:27:46,198 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 07:27:46,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 07:27:46,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:27:46,198 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:27:46,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:27:46,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:27:46,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:27:46,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:27:46,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:46,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:27:46,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:27:46,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:27:46,201 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 07:27:46,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 07:27:46,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:27:46,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:27:46,202 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:27:46,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:27:46,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:27:46,202 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 07:27:46,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5094ef48f22f1fe1203446e11fcea69068fe32fb7efd9beaaef32a9ae7a4548b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:27:46,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:27:46,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:27:46,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:27:46,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:27:46,469 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:27:46,470 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_back_harness_negated.i [2023-11-23 07:27:47,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:27:48,049 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:27:48,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_back_harness_negated.i [2023-11-23 07:27:48,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a507fa/d7cb2fb1a76b41acab18b14054c09ce5/FLAGfa5f4e2f8 [2023-11-23 07:27:48,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14a507fa/d7cb2fb1a76b41acab18b14054c09ce5 [2023-11-23 07:27:48,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:27:48,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:27:48,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:48,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:27:48,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:27:48,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:48" (1/1) ... [2023-11-23 07:27:48,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ac5d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:48, skipping insertion in model container [2023-11-23 07:27:48,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:48" (1/1) ... [2023-11-23 07:27:48,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:48,383 WARN L240 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_back_harness_negated.i[4494,4507] [2023-11-23 07:27:48,390 WARN L240 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_back_harness_negated.i[4554,4567] [2023-11-23 07:27:48,848 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,849 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,849 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,850 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,850 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,864 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,865 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,866 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,866 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,867 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,868 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,868 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:48,869 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,052 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,053 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,053 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,054 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,055 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,055 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,055 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,056 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,056 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,056 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,174 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 07:27:49,190 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:49,194 WARN L240 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_back_harness_negated.i[4494,4507] [2023-11-23 07:27:49,194 WARN L240 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_back_harness_negated.i[4554,4567] [2023-11-23 07:27:49,219 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,219 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,219 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,220 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,220 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,227 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,259 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,259 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,259 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,263 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,265 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,266 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,266 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,267 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,267 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,319 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:27:49,336 WARN L240 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_back_harness_negated.i[4494,4507] [2023-11-23 07:27:49,341 WARN L240 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_back_harness_negated.i[4554,4567] [2023-11-23 07:27:49,379 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,383 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,395 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,395 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,396 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,396 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,397 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,398 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:49,420 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:49,421 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:49,421 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:49,423 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:49,424 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:49,426 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:49,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:49,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:49,427 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:49,428 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:49,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:49,616 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,617 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,617 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,617 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,617 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,617 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,618 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,619 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,619 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,619 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:49,625 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:27:49,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49 WrapperNode [2023-11-23 07:27:49,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:49,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:49,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:27:49,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:27:49,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,724 INFO L138 Inliner]: procedures = 697, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2023-11-23 07:27:49,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:49,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:27:49,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:27:49,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:27:49,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,766 INFO L188 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-23 07:27:49,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:27:49,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:27:49,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:27:49,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:27:49,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (1/1) ... [2023-11-23 07:27:49,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:49,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:49,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:27:49,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:27:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2023-11-23 07:27:49,871 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2023-11-23 07:27:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:27:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 07:27:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-23 07:27:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-23 07:27:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:27:49,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:27:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:49,872 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:27:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:27:49,873 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:27:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:27:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:27:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:27:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:27:49,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:27:49,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:27:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:27:49,874 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:27:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:27:49,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:27:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:27:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:27:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:27:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:27:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:27:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:27:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:27:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:27:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:27:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:50,124 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:27:50,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:27:50,425 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:27:50,448 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:27:50,448 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:27:50,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:50 BoogieIcfgContainer [2023-11-23 07:27:50,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:27:50,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:27:50,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:27:50,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:27:50,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:27:48" (1/3) ... [2023-11-23 07:27:50,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38548cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:50, skipping insertion in model container [2023-11-23 07:27:50,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:49" (2/3) ... [2023-11-23 07:27:50,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38548cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:27:50, skipping insertion in model container [2023-11-23 07:27:50,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:27:50" (3/3) ... [2023-11-23 07:27:50,454 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2023-11-23 07:27:50,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:27:50,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:27:50,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:27:50,515 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bc668fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:27:50,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:27:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 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) [2023-11-23 07:27:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:27:50,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:50,538 INFO L195 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] [2023-11-23 07:27:50,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:50,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2007491860, now seen corresponding path program 1 times [2023-11-23 07:27:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:50,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743803788] [2023-11-23 07:27:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:50,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:50,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:50,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 07:27:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:50,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 07:27:50,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-23 07:27:50,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:50,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743803788] [2023-11-23 07:27:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743803788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:27:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121013511] [2023-11-23 07:27:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:50,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:27:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:27:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:27:50,850 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:27:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:50,911 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-23 07:27:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:27:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-23 07:27:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:50,920 INFO L225 Difference]: With dead ends: 168 [2023-11-23 07:27:50,921 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 07:27:50,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:27:50,927 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:50,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:27:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 07:27:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-23 07:27:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 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) [2023-11-23 07:27:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-23 07:27:51,056 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-23 07:27:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:51,056 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-23 07:27:51,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:27:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-23 07:27:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:27:51,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:51,060 INFO L195 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] [2023-11-23 07:27:51,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:51,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 117057108, now seen corresponding path program 1 times [2023-11-23 07:27:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781554973] [2023-11-23 07:27:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:51,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:51,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 07:27:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:51,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 07:27:51,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:27:51,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:51,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781554973] [2023-11-23 07:27:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781554973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:27:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319537384] [2023-11-23 07:27:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:51,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:27:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:27:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:27:51,500 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2023-11-23 07:27:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:51,662 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2023-11-23 07:27:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:27:51,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 79 [2023-11-23 07:27:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:51,666 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:27:51,666 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 07:27:51,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:27:51,668 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:51,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 483 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 07:27:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-23 07:27:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 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) [2023-11-23 07:27:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2023-11-23 07:27:51,683 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 79 [2023-11-23 07:27:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:51,683 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2023-11-23 07:27:51,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2023-11-23 07:27:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2023-11-23 07:27:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 07:27:51,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:51,688 INFO L195 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] [2023-11-23 07:27:51,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:51,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -60822184, now seen corresponding path program 1 times [2023-11-23 07:27:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175701733] [2023-11-23 07:27:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:51,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:51,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 07:27:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:52,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:27:52,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 07:27:52,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:52,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175701733] [2023-11-23 07:27:52,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175701733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:52,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:27:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709373251] [2023-11-23 07:27:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:27:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:27:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:52,187 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2023-11-23 07:27:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:52,492 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2023-11-23 07:27:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:27:52,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 81 [2023-11-23 07:27:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:52,495 INFO L225 Difference]: With dead ends: 162 [2023-11-23 07:27:52,495 INFO L226 Difference]: Without dead ends: 87 [2023-11-23 07:27:52,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:27:52,497 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:52,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 566 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-23 07:27:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-23 07:27:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 55 states have internal predecessors, (67), 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) [2023-11-23 07:27:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2023-11-23 07:27:52,511 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 81 [2023-11-23 07:27:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:52,511 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2023-11-23 07:27:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2023-11-23 07:27:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2023-11-23 07:27:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 07:27:52,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:52,512 INFO L195 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] [2023-11-23 07:27:52,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:52,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:52,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:52,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1571098229, now seen corresponding path program 1 times [2023-11-23 07:27:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217978333] [2023-11-23 07:27:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:52,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:52,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:52,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 07:27:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:52,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:27:52,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 07:27:53,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:53,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217978333] [2023-11-23 07:27:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217978333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:27:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316060454] [2023-11-23 07:27:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:53,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:27:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:27:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:27:53,010 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2023-11-23 07:27:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:53,372 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2023-11-23 07:27:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 83 [2023-11-23 07:27:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:53,376 INFO L225 Difference]: With dead ends: 169 [2023-11-23 07:27:53,376 INFO L226 Difference]: Without dead ends: 93 [2023-11-23 07:27:53,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:27:53,377 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 65 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:53,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 635 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:27:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-23 07:27:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2023-11-23 07:27:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 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) [2023-11-23 07:27:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2023-11-23 07:27:53,391 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 83 [2023-11-23 07:27:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:53,392 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2023-11-23 07:27:53,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2023-11-23 07:27:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2023-11-23 07:27:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:27:53,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:53,395 INFO L195 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] [2023-11-23 07:27:53,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:53,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:53,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:53,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 844322049, now seen corresponding path program 1 times [2023-11-23 07:27:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792749155] [2023-11-23 07:27:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:53,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:53,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 07:27:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:53,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:27:53,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:27:53,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:53,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792749155] [2023-11-23 07:27:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792749155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:53,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:53,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:27:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121448444] [2023-11-23 07:27:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:27:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:53,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:27:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:53,865 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-11-23 07:27:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:54,096 INFO L93 Difference]: Finished difference Result 165 states and 224 transitions. [2023-11-23 07:27:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:27:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 84 [2023-11-23 07:27:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:54,099 INFO L225 Difference]: With dead ends: 165 [2023-11-23 07:27:54,099 INFO L226 Difference]: Without dead ends: 92 [2023-11-23 07:27:54,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:27:54,100 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:54,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 469 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-23 07:27:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2023-11-23 07:27:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 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) [2023-11-23 07:27:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2023-11-23 07:27:54,117 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 84 [2023-11-23 07:27:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:54,118 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2023-11-23 07:27:54,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2023-11-23 07:27:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2023-11-23 07:27:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-23 07:27:54,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:54,121 INFO L195 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] [2023-11-23 07:27:54,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:54,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:54,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:54,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1222085884, now seen corresponding path program 1 times [2023-11-23 07:27:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:54,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286875876] [2023-11-23 07:27:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:54,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:54,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:54,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 07:27:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:54,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:27:54,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:27:54,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:54,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:54,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286875876] [2023-11-23 07:27:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286875876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:54,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:27:54,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:27:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869828445] [2023-11-23 07:27:54,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:54,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:27:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:27:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:27:54,717 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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) [2023-11-23 07:27:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:54,880 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2023-11-23 07:27:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:27:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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 91 [2023-11-23 07:27:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:54,882 INFO L225 Difference]: With dead ends: 166 [2023-11-23 07:27:54,882 INFO L226 Difference]: Without dead ends: 92 [2023-11-23 07:27:54,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:27:54,882 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:54,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 585 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-23 07:27:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-11-23 07:27:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.25) internal successors, (70), 58 states have internal predecessors, (70), 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) [2023-11-23 07:27:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2023-11-23 07:27:54,891 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 91 [2023-11-23 07:27:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:54,891 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2023-11-23 07:27:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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) [2023-11-23 07:27:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2023-11-23 07:27:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 07:27:54,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:54,892 INFO L195 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] [2023-11-23 07:27:54,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:55,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:55,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:55,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash -854016969, now seen corresponding path program 1 times [2023-11-23 07:27:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306900290] [2023-11-23 07:27:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:55,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:55,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:55,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-23 07:27:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:55,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 07:27:55,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:57,863 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) is different from true [2023-11-23 07:27:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:27:58,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 07:27:58,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:27:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306900290] [2023-11-23 07:27:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306900290] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:58,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:27:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-23 07:27:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933288936] [2023-11-23 07:27:58,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 07:27:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:27:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 07:27:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2023-11-23 07:27:58,419 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 07:27:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:59,761 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2023-11-23 07:27:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 07:27:59,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 93 [2023-11-23 07:27:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:59,764 INFO L225 Difference]: With dead ends: 238 [2023-11-23 07:27:59,764 INFO L226 Difference]: Without dead ends: 163 [2023-11-23 07:27:59,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2023-11-23 07:27:59,765 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 217 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:59,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 835 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 434 Invalid, 0 Unknown, 312 Unchecked, 1.0s Time] [2023-11-23 07:27:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-23 07:27:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2023-11-23 07:27:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-23 07:27:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2023-11-23 07:27:59,782 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 93 [2023-11-23 07:27:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:59,783 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2023-11-23 07:27:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 07:27:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2023-11-23 07:27:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 07:27:59,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:59,785 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:59,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:59,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:59,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -293317191, now seen corresponding path program 1 times [2023-11-23 07:27:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:27:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023243913] [2023-11-23 07:27:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:27:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:27:59,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:27:59,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-23 07:28:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:28:00,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 07:28:00,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:00,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023243913] [2023-11-23 07:28:00,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023243913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:00,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 07:28:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955394795] [2023-11-23 07:28:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:00,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:28:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:28:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:00,156 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:28:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:00,257 INFO L93 Difference]: Finished difference Result 202 states and 276 transitions. [2023-11-23 07:28:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-11-23 07:28:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:00,259 INFO L225 Difference]: With dead ends: 202 [2023-11-23 07:28:00,259 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 07:28:00,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:28:00,260 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:00,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 313 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 07:28:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2023-11-23 07:28:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.267605633802817) internal successors, (90), 73 states have internal predecessors, (90), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-23 07:28:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions. [2023-11-23 07:28:00,284 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 93 [2023-11-23 07:28:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:00,285 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 142 transitions. [2023-11-23 07:28:00,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:28:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions. [2023-11-23 07:28:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-23 07:28:00,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:00,286 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2023-11-23 07:28:00,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:00,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:00,501 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:00,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash 967600059, now seen corresponding path program 1 times [2023-11-23 07:28:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495444322] [2023-11-23 07:28:00,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:00,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:00,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:00,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-23 07:28:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 07:28:00,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:28:00,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:00,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495444322] [2023-11-23 07:28:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495444322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:00,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 07:28:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542195190] [2023-11-23 07:28:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:00,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:28:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:28:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:28:00,675 INFO L87 Difference]: Start difference. First operand 107 states and 142 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:28:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:00,798 INFO L93 Difference]: Finished difference Result 200 states and 273 transitions. [2023-11-23 07:28:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:28:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-11-23 07:28:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:00,799 INFO L225 Difference]: With dead ends: 200 [2023-11-23 07:28:00,799 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 07:28:00,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:28:00,800 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:00,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 403 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 07:28:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-11-23 07:28:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.25) internal successors, (85), 70 states have internal predecessors, (85), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-23 07:28:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2023-11-23 07:28:00,807 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 93 [2023-11-23 07:28:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:00,808 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2023-11-23 07:28:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 07:28:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2023-11-23 07:28:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-23 07:28:00,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:00,810 INFO L195 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] [2023-11-23 07:28:00,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:01,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:01,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:01,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1599004629, now seen corresponding path program 1 times [2023-11-23 07:28:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438309484] [2023-11-23 07:28:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:01,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-23 07:28:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-23 07:28:01,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:03,456 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)) (_ bv16 64)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)) v_aws_linked_list_back_~list.base_BEFORE_CALL_4)))) is different from true [2023-11-23 07:28:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 07:28:04,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:08,671 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 07:28:08,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2023-11-23 07:28:08,686 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-23 07:28:08,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-23 07:28:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-23 07:28:08,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438309484] [2023-11-23 07:28:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438309484] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:28:08,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2023-11-23 07:28:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846158052] [2023-11-23 07:28:08,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:28:08,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 07:28:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 07:28:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2023-11-23 07:28:08,699 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 07:28:13,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:16,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:18,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:20,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:23,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:23,600 INFO L93 Difference]: Finished difference Result 270 states and 355 transitions. [2023-11-23 07:28:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-23 07:28:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 94 [2023-11-23 07:28:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:23,612 INFO L225 Difference]: With dead ends: 270 [2023-11-23 07:28:23,612 INFO L226 Difference]: Without dead ends: 154 [2023-11-23 07:28:23,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=238, Invalid=1656, Unknown=2, NotChecked=84, Total=1980 [2023-11-23 07:28:23,614 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 175 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 68 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 944 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1219 Invalid, 5 Unknown, 435 Unchecked, 13.2s Time] [2023-11-23 07:28:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-23 07:28:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2023-11-23 07:28:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-11-23 07:28:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2023-11-23 07:28:23,626 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 94 [2023-11-23 07:28:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:23,626 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2023-11-23 07:28:23,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 07:28:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2023-11-23 07:28:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-23 07:28:23,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:23,627 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:23,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:23,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:23,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:23,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash -297132061, now seen corresponding path program 2 times [2023-11-23 07:28:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292675667] [2023-11-23 07:28:23,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:28:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:23,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:23,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:23,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 07:28:23,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 07:28:23,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:28:23,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 07:28:23,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-23 07:28:23,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:23,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292675667] [2023-11-23 07:28:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292675667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:28:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746659012] [2023-11-23 07:28:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:23,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:28:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:28:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:28:23,967 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 07:28:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:24,146 INFO L93 Difference]: Finished difference Result 142 states and 181 transitions. [2023-11-23 07:28:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:28:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-11-23 07:28:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:24,148 INFO L225 Difference]: With dead ends: 142 [2023-11-23 07:28:24,148 INFO L226 Difference]: Without dead ends: 140 [2023-11-23 07:28:24,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:28:24,148 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:24,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 505 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-23 07:28:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2023-11-23 07:28:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 99 states have internal predecessors, (119), 28 states have call successors, (28), 12 states have call predecessors, (28), 13 states have return successors, (31), 27 states have call predecessors, (31), 27 states have call successors, (31) [2023-11-23 07:28:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2023-11-23 07:28:24,161 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 103 [2023-11-23 07:28:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:24,161 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2023-11-23 07:28:24,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 07:28:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2023-11-23 07:28:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 07:28:24,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:24,162 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:24,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:24,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:24,363 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:24,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash 625334195, now seen corresponding path program 1 times [2023-11-23 07:28:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594318233] [2023-11-23 07:28:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:24,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:24,364 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:24,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-23 07:28:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 07:28:24,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 73 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:28:25,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:25,606 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 07:28:25,606 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 [2023-11-23 07:28:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 07:28:25,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594318233] [2023-11-23 07:28:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594318233] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:28:25,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:25,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-11-23 07:28:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647581978] [2023-11-23 07:28:25,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:28:25,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:28:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:28:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:28:25,843 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 07:28:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:28,958 INFO L93 Difference]: Finished difference Result 281 states and 376 transitions. [2023-11-23 07:28:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 07:28:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) Word has length 115 [2023-11-23 07:28:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:28,961 INFO L225 Difference]: With dead ends: 281 [2023-11-23 07:28:28,961 INFO L226 Difference]: Without dead ends: 183 [2023-11-23 07:28:28,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 07:28:28,962 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 124 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 967 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 486 Invalid, 3 Unknown, 0 Unchecked, 2.0s Time] [2023-11-23 07:28:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-23 07:28:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2023-11-23 07:28:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 103 states have internal predecessors, (125), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (37), 29 states have call predecessors, (37), 27 states have call successors, (37) [2023-11-23 07:28:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2023-11-23 07:28:29,009 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 115 [2023-11-23 07:28:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:29,010 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2023-11-23 07:28:29,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 15 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 07:28:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2023-11-23 07:28:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 07:28:29,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:29,012 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:29,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:29,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:29,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:29,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1059063281, now seen corresponding path program 1 times [2023-11-23 07:28:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203409415] [2023-11-23 07:28:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:29,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:29,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:29,225 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:29,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-23 07:28:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:29,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 07:28:29,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:28:29,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:29,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 07:28:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203409415] [2023-11-23 07:28:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203409415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 07:28:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269225080] [2023-11-23 07:28:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:28:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 07:28:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:28:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:28:29,597 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:29,711 INFO L93 Difference]: Finished difference Result 255 states and 337 transitions. [2023-11-23 07:28:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2023-11-23 07:28:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:29,713 INFO L225 Difference]: With dead ends: 255 [2023-11-23 07:28:29,713 INFO L226 Difference]: Without dead ends: 143 [2023-11-23 07:28:29,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:28:29,719 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:29,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-23 07:28:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2023-11-23 07:28:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.202020202020202) internal successors, (119), 101 states have internal predecessors, (119), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35) [2023-11-23 07:28:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2023-11-23 07:28:29,743 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 115 [2023-11-23 07:28:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:29,744 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2023-11-23 07:28:29,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 07:28:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2023-11-23 07:28:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 07:28:29,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:29,745 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:29,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:29,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:29,947 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:29,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 107688057, now seen corresponding path program 1 times [2023-11-23 07:28:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 07:28:29,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139832828] [2023-11-23 07:28:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:29,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 07:28:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 07:28:29,949 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 07:28:29,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-23 07:28:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:28:30,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:32,552 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) (_ bv8 64)))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1))))) is different from true Killed by 15