./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_end_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_end_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 bbb8bf94842ca8a2b592a01a3e1f633d5f489747e485942f3148ddc1f5ec733e --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:25:53,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:25:53,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:25:53,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:25:53,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:25:53,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:25:53,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:25:53,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:25:53,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:25:53,969 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:25:53,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:25:53,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:25:53,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:25:53,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:25:53,971 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:25:53,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:25:53,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:25:53,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:25:53,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:25:53,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:25:53,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:25:53,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:25:53,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:25:53,973 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:25:53,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:25:53,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:25:53,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:25:53,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:25:53,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:25:53,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:25:53,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:25:53,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:25:53,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:25:53,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:25:53,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:25:53,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:25:53,977 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:25:53,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:25:53,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:25:53,978 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 -> bbb8bf94842ca8a2b592a01a3e1f633d5f489747e485942f3148ddc1f5ec733e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:25:54,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:25:54,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:25:54,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:25:54,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:25:54,184 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:25:54,185 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_end_harness_negated.i [2023-11-23 07:25:55,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:25:55,604 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:25:55,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_end_harness_negated.i [2023-11-23 07:25:55,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe7bbda9/66dee6e3e1104943a865e780885c69a9/FLAG2e83e4c54 [2023-11-23 07:25:55,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe7bbda9/66dee6e3e1104943a865e780885c69a9 [2023-11-23 07:25:55,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:25:55,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:25:55,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:25:55,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:25:55,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:25:55,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:25:55" (1/1) ... [2023-11-23 07:25:55,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552dc04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:55, skipping insertion in model container [2023-11-23 07:25:55,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:25:55" (1/1) ... [2023-11-23 07:25:55,714 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:25:55,907 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_end_harness_negated.i[4493,4506] [2023-11-23 07:25:55,913 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_end_harness_negated.i[4553,4566] [2023-11-23 07:25:56,448 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,450 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,452 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,452 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,453 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,461 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,462 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,472 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,482 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,483 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,694 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:25:56,695 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:25:56,696 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:25:56,697 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:25:56,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:25:56,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:25:56,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:25:56,699 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:25:56,699 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:25:56,700 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:25:56,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:25:56,881 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:25:56,898 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_end_harness_negated.i[4493,4506] [2023-11-23 07:25:56,898 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_end_harness_negated.i[4553,4566] [2023-11-23 07:25:56,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,942 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,942 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,951 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,952 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,953 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,954 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,955 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,956 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,957 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,957 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:25:56,995 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:25:57,005 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:25:57,006 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:25:57,007 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:25:57,007 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:25:57,008 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:25:57,008 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:25:57,010 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:25:57,010 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:25:57,011 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:25:57,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:25:57,235 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,235 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,236 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,236 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,236 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,236 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,237 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,237 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,237 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,237 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,237 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,238 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,238 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,238 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,238 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,238 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:25:57,244 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:25:57,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57 WrapperNode [2023-11-23 07:25:57,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:25:57,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:25:57,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:25:57,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:25:57,251 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:25:57" (1/1) ... [2023-11-23 07:25:57,318 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:25:57" (1/1) ... [2023-11-23 07:25:57,359 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 07:25:57,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:25:57,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:25:57,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:25:57,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:25:57,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,399 INFO L188 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 14, 5]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2023-11-23 07:25:57,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:25:57,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:25:57,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:25:57,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:25:57,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (1/1) ... [2023-11-23 07:25:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:25:57,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:57,472 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:25:57,484 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:25:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:25:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:25:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:25:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:25:57,509 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:25:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:25:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:25:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:25:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:25:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:25:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:25:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:25:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:25:57,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:25:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:25:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:25:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:25:57,512 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:25:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:25:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:25:57,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:25:57,690 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:25:57,692 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:25:57,842 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:25:57,865 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:25:57,866 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:25:57,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:25:57 BoogieIcfgContainer [2023-11-23 07:25:57,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:25:57,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:25:57,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:25:57,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:25:57,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:25:55" (1/3) ... [2023-11-23 07:25:57,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27795b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:25:57, skipping insertion in model container [2023-11-23 07:25:57,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:25:57" (2/3) ... [2023-11-23 07:25:57,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27795b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:25:57, skipping insertion in model container [2023-11-23 07:25:57,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:25:57" (3/3) ... [2023-11-23 07:25:57,876 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness_negated.i [2023-11-23 07:25:57,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:25:57,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:25:57,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:25:57,929 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;@6baa4ad5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:25:57,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:25:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 07:25:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:57,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:57,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:57,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:57,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1608602976, now seen corresponding path program 1 times [2023-11-23 07:25:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433880396] [2023-11-23 07:25:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:25:58,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:58,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433880396] [2023-11-23 07:25:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433880396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:25:58,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:25:58,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:25:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450788650] [2023-11-23 07:25:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:25:58,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:25:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:25:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:25:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:25:58,338 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:25:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:25:58,390 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 07:25:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:25:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 07:25:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:25:58,399 INFO L225 Difference]: With dead ends: 112 [2023-11-23 07:25:58,400 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:25:58,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:25:58,411 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:25:58,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:25:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:25:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 07:25:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:25:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 07:25:58,461 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 07:25:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:25:58,462 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 07:25:58,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:25:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 07:25:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:25:58,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:25:58,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:25:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:25:58,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:25:58,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:25:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash 195324314, now seen corresponding path program 1 times [2023-11-23 07:25:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:25:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292815078] [2023-11-23 07:25:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:25:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:25:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:25:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:25:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:25:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:25:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:25:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:25:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:25:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:25:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292815078] [2023-11-23 07:25:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292815078] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:25:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274575132] [2023-11-23 07:25:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:25:58,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:25:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:25:58,911 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:25:58,938 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:25:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:25:59,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 07:25:59,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:25:59,137 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:25:59,146 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 24 treesize of output 9 [2023-11-23 07:25:59,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:59,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:25:59,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:25:59,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:25:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:25:59,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:25:59,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274575132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:25:59,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:25:59,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 07:25:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696390766] [2023-11-23 07:25:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:25:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:25:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:25:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:25:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:25:59,741 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:26:01,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:26:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:02,299 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 07:26:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 07:26:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:02,302 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:26:02,302 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 07:26:02,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:26:02,304 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:02,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 306 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 07:26:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 07:26:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 07:26:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.36986301369863) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 07:26:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2023-11-23 07:26:02,318 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 65 [2023-11-23 07:26:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:02,318 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2023-11-23 07:26:02,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 07:26:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2023-11-23 07:26:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:26:02,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:02,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:02,335 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:26:02,533 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:26:02,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:02,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1854063528, now seen corresponding path program 1 times [2023-11-23 07:26:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482606385] [2023-11-23 07:26:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:26:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:26:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:26:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:02,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482606385] [2023-11-23 07:26:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482606385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:02,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943624349] [2023-11-23 07:26:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:02,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:02,754 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:26:02,781 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:26:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:02,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 07:26:02,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:02,909 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 24 treesize of output 9 [2023-11-23 07:26:02,918 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:26:02,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:02,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-11-23 07:26:02,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:02,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:02,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-11-23 07:26:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:26:03,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943624349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:03,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 07:26:03,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878977125] [2023-11-23 07:26:03,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:03,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:26:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:26:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:26:03,950 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:26:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:04,615 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2023-11-23 07:26:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:26:04,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 07:26:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:04,617 INFO L225 Difference]: With dead ends: 157 [2023-11-23 07:26:04,617 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 07:26:04,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:26:04,618 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:04,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 07:26:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 07:26:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-23 07:26:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 74 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 07:26:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2023-11-23 07:26:04,629 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 65 [2023-11-23 07:26:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:04,630 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2023-11-23 07:26:04,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 07:26:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2023-11-23 07:26:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 07:26:04,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:04,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:04,656 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:26:04,844 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:26:04,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:04,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1693596756, now seen corresponding path program 1 times [2023-11-23 07:26:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88587584] [2023-11-23 07:26:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 07:26:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:26:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:26:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88587584] [2023-11-23 07:26:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88587584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74335360] [2023-11-23 07:26:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:05,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:05,015 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:26:05,043 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:26:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:05,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 07:26:05,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:05,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 07:26:05,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2023-11-23 07:26:05,231 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-23 07:26:05,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 07:26:05,295 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse2 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select .cse1 .cse4))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse3 v_arrayElimArr_2) .cse2) .cse4 .cse3)) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= .cse2 .cse3))))))) is different from true [2023-11-23 07:26:05,632 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse2 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select .cse1 .cse4))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse3 v_arrayElimArr_2) .cse2) .cse4 .cse3)) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= .cse2 .cse3))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= .cse6 .cse7) (not (= .cse7 .cse6)) (<= 2 .cse6)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:05,982 WARN L876 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24))) (let ((.cse1 (select .cse2 .cse3))) (let ((.cse0 (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse1))) (or (and (not .cse0) (<= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (and (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) .cse3 .cse1)) (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))))) (and .cse0 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (<= 2 .cse6) (not (= .cse7 .cse6)) (<= .cse6 .cse7))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11)) (<= .cse10 .cse11) (not (= .cse11 .cse10)) (<= 2 .cse10)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:06,043 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (<= 2 .cse1) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse7 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse7) .cse9 .cse8)) (<= 2 .cse7) (not (= .cse8 .cse7)) (<= .cse7 .cse8))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse13 .cse12)) (<= .cse11 .cse12) (not (= .cse12 .cse11)) (<= 2 .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:06,121 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_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (<= 2 .cse1) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)))))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse7 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse7) .cse9 .cse8)) (<= 2 .cse7) (not (= .cse8 .cse7)) (<= .cse7 .cse8))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse13 .cse12)) (<= .cse11 .cse12) (not (= .cse12 .cse11)) (<= 2 .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:06,400 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (<= 2 .cse1) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse7 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse7) .cse9 .cse8)) (<= 2 .cse7) (not (= .cse8 .cse7)) (<= .cse7 .cse8))))))) (or (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1) |c_aws_linked_list_is_valid_#t~short310#1|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse13 .cse12)) (<= .cse11 .cse12) (not (= .cse12 .cse11)) (<= 2 .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:06,597 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_2| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse1 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse2 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (<= 2 .cse1) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse1) .cse4 .cse2)))))))) (<= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse7 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_2) .cse7) .cse9 .cse8)) (<= 2 .cse7) (not (= .cse8 .cse7)) (<= .cse7 .cse8))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse13 .cse12)) (<= .cse11 .cse12) (not (= .cse12 .cse11)) (<= 2 .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2023-11-23 07:26:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-23 07:26:06,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:06,987 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 07:26:06,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 176 [2023-11-23 07:26:06,993 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 25 treesize of output 21 [2023-11-23 07:26:07,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 73 treesize of output 89 [2023-11-23 07:26:07,035 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 6 treesize of output 4 [2023-11-23 07:26:07,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:07,075 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 19 treesize of output 23 [2023-11-23 07:26:07,081 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 7 treesize of output 3 [2023-11-23 07:26:07,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:07,098 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 101 treesize of output 113 [2023-11-23 07:26:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74335360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:26:07,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:26:07,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2023-11-23 07:26:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307734155] [2023-11-23 07:26:07,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:07,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 07:26:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 07:26:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=322, Unknown=21, NotChecked=294, Total=702 [2023-11-23 07:26:07,208 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:26:07,635 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse2 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select .cse1 .cse4))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse3 v_arrayElimArr_2) .cse2) .cse4 .cse3)) (<= 2 .cse2) (not (= .cse3 .cse2)) (<= .cse2 .cse3))))))) (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) is different from true [2023-11-23 07:26:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:08,342 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2023-11-23 07:26:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 07:26:08,342 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 65 [2023-11-23 07:26:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:08,344 INFO L225 Difference]: With dead ends: 254 [2023-11-23 07:26:08,344 INFO L226 Difference]: Without dead ends: 146 [2023-11-23 07:26:08,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=836, Unknown=44, NotChecked=536, Total=1560 [2023-11-23 07:26:08,345 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 80 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 23 mSolverCounterUnsat, 78 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 78 IncrementalHoareTripleChecker+Unknown, 1237 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:08,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 710 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 517 Invalid, 78 Unknown, 1237 Unchecked, 0.7s Time] [2023-11-23 07:26:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-23 07:26:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2023-11-23 07:26:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 96 states have internal predecessors, (126), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2023-11-23 07:26:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2023-11-23 07:26:08,361 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 65 [2023-11-23 07:26:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:08,361 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2023-11-23 07:26:08,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 23 states have internal predecessors, (87), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 07:26:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2023-11-23 07:26:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 07:26:08,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:08,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 07:26:08,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:08,581 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:26:08,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:08,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -425929010, now seen corresponding path program 1 times [2023-11-23 07:26:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176886481] [2023-11-23 07:26:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:26:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:26:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 07:26:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:26:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176886481] [2023-11-23 07:26:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176886481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033311262] [2023-11-23 07:26:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:08,769 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:26:08,795 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:26:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:08,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:26:08,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:08,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033311262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:08,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:26:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950108709] [2023-11-23 07:26:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:08,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:26:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:26:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:26:08,959 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:09,068 INFO L93 Difference]: Finished difference Result 238 states and 332 transitions. [2023-11-23 07:26:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:26:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 07:26:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:09,070 INFO L225 Difference]: With dead ends: 238 [2023-11-23 07:26:09,070 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 07:26:09,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:26:09,071 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:09,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 07:26:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 07:26:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.34375) internal successors, (129), 102 states have internal predecessors, (129), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:26:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2023-11-23 07:26:09,085 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 67 [2023-11-23 07:26:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:09,085 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2023-11-23 07:26:09,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2023-11-23 07:26:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 07:26:09,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:09,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:26:09,100 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:26:09,297 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:26:09,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:09,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 593027963, now seen corresponding path program 1 times [2023-11-23 07:26:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332754164] [2023-11-23 07:26:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:26:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:26:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:26:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:09,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332754164] [2023-11-23 07:26:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332754164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175511712] [2023-11-23 07:26:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:09,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:09,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:09,526 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:26:09,554 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:26:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:09,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:26:09,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:26:09,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175511712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:09,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 07:26:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455055125] [2023-11-23 07:26:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:26:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:26:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:26:09,721 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:09,876 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2023-11-23 07:26:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:09,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 07:26:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:09,877 INFO L225 Difference]: With dead ends: 271 [2023-11-23 07:26:09,877 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 07:26:09,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:26:09,879 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:09,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 07:26:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2023-11-23 07:26:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 107 states have internal predecessors, (136), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:26:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2023-11-23 07:26:09,893 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 69 [2023-11-23 07:26:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:09,893 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2023-11-23 07:26:09,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2023-11-23 07:26:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:26:09,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:09,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:26:09,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 07:26:10,106 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:26:10,107 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:10,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 624700371, now seen corresponding path program 1 times [2023-11-23 07:26:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572058624] [2023-11-23 07:26:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:26:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 07:26:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:26:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 07:26:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 07:26:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572058624] [2023-11-23 07:26:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572058624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794061972] [2023-11-23 07:26:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:10,240 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:26:10,297 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:26:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:26:10,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 07:26:10,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794061972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 07:26:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450038691] [2023-11-23 07:26:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:10,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:26:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:26:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:10,413 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:10,451 INFO L93 Difference]: Finished difference Result 268 states and 380 transitions. [2023-11-23 07:26:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:26:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 07:26:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:10,452 INFO L225 Difference]: With dead ends: 268 [2023-11-23 07:26:10,453 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 07:26:10,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 07:26:10,454 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:10,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 07:26:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-11-23 07:26:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 110 states have internal predecessors, (139), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:26:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2023-11-23 07:26:10,466 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 70 [2023-11-23 07:26:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:10,466 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2023-11-23 07:26:10,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:26:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2023-11-23 07:26:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:26:10,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:10,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 07:26:10,494 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:26:10,680 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:26:10,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:10,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2024161169, now seen corresponding path program 1 times [2023-11-23 07:26:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438930982] [2023-11-23 07:26:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:26:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 07:26:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438930982] [2023-11-23 07:26:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438930982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753139050] [2023-11-23 07:26:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:10,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:10,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:10,893 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:26:10,918 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:26:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:11,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-23 07:26:11,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:11,065 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 14 treesize of output 15 [2023-11-23 07:26:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 07:26:11,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:11,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2023-11-23 07:26:11,124 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-11-23 07:26:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:26:12,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:13,050 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse1 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 8))) (and (forall ((v_ArrVal_508 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1) 0)))) is different from false [2023-11-23 07:26:13,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1518 treesize of output 1494 [2023-11-23 07:26:13,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:13,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:13,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 124 treesize of output 118 [2023-11-23 07:26:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753139050] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:13,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:26:13,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 14] total 27 [2023-11-23 07:26:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432957566] [2023-11-23 07:26:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:26:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:26:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=577, Unknown=1, NotChecked=48, Total=702 [2023-11-23 07:26:13,290 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:13,764 INFO L93 Difference]: Finished difference Result 253 states and 359 transitions. [2023-11-23 07:26:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:26:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:26:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:13,765 INFO L225 Difference]: With dead ends: 253 [2023-11-23 07:26:13,765 INFO L226 Difference]: Without dead ends: 174 [2023-11-23 07:26:13,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=767, Unknown=9, NotChecked=56, Total=930 [2023-11-23 07:26:13,767 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:13,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 349 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 1 Unknown, 98 Unchecked, 0.3s Time] [2023-11-23 07:26:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-23 07:26:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2023-11-23 07:26:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.320754716981132) internal successors, (140), 112 states have internal predecessors, (140), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:26:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2023-11-23 07:26:13,779 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 77 [2023-11-23 07:26:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:13,780 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2023-11-23 07:26:13,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:26:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2023-11-23 07:26:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:26:13,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:13,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:26:13,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:26:13,996 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:26:13,997 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:13,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1743363477, now seen corresponding path program 1 times [2023-11-23 07:26:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604314787] [2023-11-23 07:26:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:26:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 07:26:14,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:14,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604314787] [2023-11-23 07:26:14,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604314787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678803597] [2023-11-23 07:26:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:14,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:14,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:14,735 INFO L229 MonitoredProcess]: Starting monitored process 9 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:26:14,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:26:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:14,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 07:26:14,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:14,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 07:26:16,999 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_26| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_32|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_32|) (= (select .cse0 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_26|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_32|) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_32| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_26| 24)))))) is different from true [2023-11-23 07:27:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 22 not checked. [2023-11-23 07:27:22,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:29,272 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-23 07:27:29,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 88 [2023-11-23 07:27:29,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:29,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 104 [2023-11-23 07:27:29,291 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 29 treesize of output 27 [2023-11-23 07:27:29,330 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 6 treesize of output 4 [2023-11-23 07:27:29,335 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 5 treesize of output 3 [2023-11-23 07:27:29,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:29,359 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 17 treesize of output 21 [2023-11-23 07:27:29,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:29,381 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 113 treesize of output 109 [2023-11-23 07:27:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:27:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678803597] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:33,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:27:33,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 12] total 33 [2023-11-23 07:27:33,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160577383] [2023-11-23 07:27:33,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:33,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:27:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:27:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=882, Unknown=13, NotChecked=60, Total=1056 [2023-11-23 07:27:33,588 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:34,060 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2023-11-23 07:27:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:27:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:27:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:34,062 INFO L225 Difference]: With dead ends: 267 [2023-11-23 07:27:34,062 INFO L226 Difference]: Without dead ends: 182 [2023-11-23 07:27:34,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 78.3s TimeCoverageRelationStatistics Valid=128, Invalid=1123, Unknown=13, NotChecked=68, Total=1332 [2023-11-23 07:27:34,063 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:34,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 386 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:27:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-23 07:27:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2023-11-23 07:27:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 114 states have internal predecessors, (141), 25 states have call successors, (25), 10 states have call predecessors, (25), 14 states have return successors, (34), 23 states have call predecessors, (34), 23 states have call successors, (34) [2023-11-23 07:27:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 200 transitions. [2023-11-23 07:27:34,084 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 200 transitions. Word has length 77 [2023-11-23 07:27:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:34,084 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 200 transitions. [2023-11-23 07:27:34,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 200 transitions. [2023-11-23 07:27:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:27:34,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:34,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:34,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 07:27:34,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:34,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1815246183, now seen corresponding path program 1 times [2023-11-23 07:27:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106125483] [2023-11-23 07:27:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:27:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:27:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:27:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:27:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:27:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:27:34,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106125483] [2023-11-23 07:27:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106125483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061455304] [2023-11-23 07:27:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:34,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:34,476 INFO L229 MonitoredProcess]: Starting monitored process 10 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:27:34,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:27:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:34,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:27:34,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 07:27:34,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061455304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:27:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 07:27:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063153470] [2023-11-23 07:27:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:34,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:27:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:27:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:27:34,738 INFO L87 Difference]: Start difference. First operand 148 states and 200 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:34,810 INFO L93 Difference]: Finished difference Result 307 states and 426 transitions. [2023-11-23 07:27:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:27:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 07:27:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:34,812 INFO L225 Difference]: With dead ends: 307 [2023-11-23 07:27:34,812 INFO L226 Difference]: Without dead ends: 139 [2023-11-23 07:27:34,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:27:34,814 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 21 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:34,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 346 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:27:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-23 07:27:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-11-23 07:27:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.26) internal successors, (126), 105 states have internal predecessors, (126), 25 states have call successors, (25), 10 states have call predecessors, (25), 13 states have return successors, (31), 23 states have call predecessors, (31), 23 states have call successors, (31) [2023-11-23 07:27:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 182 transitions. [2023-11-23 07:27:34,831 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 182 transitions. Word has length 77 [2023-11-23 07:27:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:34,831 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 182 transitions. [2023-11-23 07:27:34,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 07:27:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2023-11-23 07:27:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 07:27:34,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:34,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:34,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-23 07:27:35,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 07:27:35,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:35,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -676470206, now seen corresponding path program 1 times [2023-11-23 07:27:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510848387] [2023-11-23 07:27:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 07:27:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 07:27:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 07:27:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:27:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 07:27:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510848387] [2023-11-23 07:27:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510848387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67897251] [2023-11-23 07:27:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:35,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:35,275 INFO L229 MonitoredProcess]: Starting monitored process 11 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:27:35,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:27:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:35,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 07:27:35,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:35,478 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:27:35,496 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 24 treesize of output 9 [2023-11-23 07:27:35,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,540 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:27:35,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,545 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:27:35,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,548 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 25 treesize of output 18 [2023-11-23 07:27:35,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,557 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:27:35,644 INFO L349 Elim1Store]: treesize reduction 64, result has 7.2 percent of original size [2023-11-23 07:27:35,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 129 [2023-11-23 07:27:35,652 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 18 treesize of output 17 [2023-11-23 07:27:35,659 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2023-11-23 07:27:35,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 102 [2023-11-23 07:27:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,666 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 86 treesize of output 85 [2023-11-23 07:27:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:35,673 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 86 treesize of output 44 [2023-11-23 07:27:35,701 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 11 treesize of output 3 [2023-11-23 07:27:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:27:36,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:37,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 95 [2023-11-23 07:27:37,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,163 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2023-11-23 07:27:37,182 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 6 [2023-11-23 07:27:37,185 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 6 treesize of output 4 [2023-11-23 07:27:37,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_748 Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16) (select v_arrayElimArr_8 v_subst_1))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_748)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| v_arrayElimArr_8))) (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 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| 1)) (forall ((v_subst_2 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_9 v_subst_2))) (forall ((v_ArrVal_751 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27|)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| v_ArrVal_751) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27| v_arrayElimArr_9) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_27|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2023-11-23 07:27:37,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:37,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:37,289 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:27:37,289 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 311 treesize of output 298 [2023-11-23 07:27:37,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,301 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 286 treesize of output 260 [2023-11-23 07:27:37,307 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 203 treesize of output 199 [2023-11-23 07:27:37,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,320 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 223 treesize of output 224 [2023-11-23 07:27:37,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:37,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:37,386 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:27:37,386 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 285 treesize of output 314 [2023-11-23 07:27:37,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,411 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 344 treesize of output 342 [2023-11-23 07:27:37,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:37,431 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 301 treesize of output 298 [2023-11-23 07:27:38,003 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 7 treesize of output 3 [2023-11-23 07:27:38,029 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:27:38,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:38,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:38,186 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 121 treesize of output 127 [2023-11-23 07:27:38,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:38,280 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 80 treesize of output 82 [2023-11-23 07:27:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 07:27:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67897251] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:38,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:27:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2023-11-23 07:27:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122802201] [2023-11-23 07:27:38,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-23 07:27:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-23 07:27:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=438, Unknown=7, NotChecked=42, Total=552 [2023-11-23 07:27:38,331 INFO L87 Difference]: Start difference. First operand 139 states and 182 transitions. Second operand has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:27:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:40,175 INFO L93 Difference]: Finished difference Result 348 states and 489 transitions. [2023-11-23 07:27:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 07:27:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 78 [2023-11-23 07:27:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:40,177 INFO L225 Difference]: With dead ends: 348 [2023-11-23 07:27:40,177 INFO L226 Difference]: Without dead ends: 235 [2023-11-23 07:27:40,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=1521, Unknown=12, NotChecked=80, Total=1806 [2023-11-23 07:27:40,178 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 99 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:40,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1045 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1037 Invalid, 0 Unknown, 182 Unchecked, 1.1s Time] [2023-11-23 07:27:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-23 07:27:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 219. [2023-11-23 07:27:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 152 states have (on average 1.263157894736842) internal successors, (192), 163 states have internal predecessors, (192), 45 states have call successors, (45), 14 states have call predecessors, (45), 21 states have return successors, (66), 41 states have call predecessors, (66), 42 states have call successors, (66) [2023-11-23 07:27:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 303 transitions. [2023-11-23 07:27:40,203 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 303 transitions. Word has length 78 [2023-11-23 07:27:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:40,204 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 303 transitions. [2023-11-23 07:27:40,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.333333333333333) internal successors, (112), 23 states have internal predecessors, (112), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-23 07:27:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 303 transitions. [2023-11-23 07:27:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:27:40,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:40,206 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:27:40,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-23 07:27:40,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 07:27:40,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:40,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 621904875, now seen corresponding path program 1 times [2023-11-23 07:27:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32280495] [2023-11-23 07:27:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:27:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:27:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32280495] [2023-11-23 07:27:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32280495] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631401394] [2023-11-23 07:27:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:40,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:40,792 INFO L229 MonitoredProcess]: Starting monitored process 12 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:27:40,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:27:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:40,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-23 07:27:40,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:41,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 07:27:41,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 07:27:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 07:27:41,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:27:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631401394] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:41,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:27:41,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 14] total 24 [2023-11-23 07:27:41,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788887165] [2023-11-23 07:27:41,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:41,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:27:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:27:41,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:27:41,660 INFO L87 Difference]: Start difference. First operand 219 states and 303 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:27:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:41,739 INFO L93 Difference]: Finished difference Result 239 states and 332 transitions. [2023-11-23 07:27:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:27:41,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-23 07:27:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:41,741 INFO L225 Difference]: With dead ends: 239 [2023-11-23 07:27:41,741 INFO L226 Difference]: Without dead ends: 237 [2023-11-23 07:27:41,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2023-11-23 07:27:41,742 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:41,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 352 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:27:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-23 07:27:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2023-11-23 07:27:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 160 states have (on average 1.25) internal successors, (200), 173 states have internal predecessors, (200), 48 states have call successors, (48), 16 states have call predecessors, (48), 25 states have return successors, (78), 44 states have call predecessors, (78), 45 states have call successors, (78) [2023-11-23 07:27:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-23 07:27:41,763 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 80 [2023-11-23 07:27:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:41,763 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-23 07:27:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:27:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-23 07:27:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 07:27:41,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:41,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:27:41,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 07:27:41,977 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:41,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 640706025, now seen corresponding path program 1 times [2023-11-23 07:27:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116700458] [2023-11-23 07:27:41,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:27:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:27:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116700458] [2023-11-23 07:27:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116700458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855244939] [2023-11-23 07:27:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:42,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:42,286 INFO L229 MonitoredProcess]: Starting monitored process 13 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:27:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:27:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:42,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:27:42,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:27:42,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855244939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:27:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-23 07:27:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670448845] [2023-11-23 07:27:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:27:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:27:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:27:42,578 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:27:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:42,710 INFO L93 Difference]: Finished difference Result 426 states and 582 transitions. [2023-11-23 07:27:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:27:42,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2023-11-23 07:27:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:42,712 INFO L225 Difference]: With dead ends: 426 [2023-11-23 07:27:42,712 INFO L226 Difference]: Without dead ends: 234 [2023-11-23 07:27:42,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:27:42,714 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:42,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 275 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:27:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-23 07:27:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-11-23 07:27:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 160 states have (on average 1.23125) internal successors, (197), 173 states have internal predecessors, (197), 48 states have call successors, (48), 16 states have call predecessors, (48), 25 states have return successors, (78), 44 states have call predecessors, (78), 45 states have call successors, (78) [2023-11-23 07:27:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 323 transitions. [2023-11-23 07:27:42,735 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 323 transitions. Word has length 82 [2023-11-23 07:27:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:42,735 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 323 transitions. [2023-11-23 07:27:42,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-23 07:27:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 323 transitions. [2023-11-23 07:27:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:27:42,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:42,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:42,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:27:42,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:42,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1084012182, now seen corresponding path program 2 times [2023-11-23 07:27:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356976990] [2023-11-23 07:27:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:27:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:27:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356976990] [2023-11-23 07:27:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356976990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26690779] [2023-11-23 07:27:43,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:27:43,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:43,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:43,244 INFO L229 MonitoredProcess]: Starting monitored process 14 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:27:43,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 07:27:43,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 07:27:43,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:27:43,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:27:43,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-23 07:27:43,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:27:43,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26690779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:27:43,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:27:43,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2023-11-23 07:27:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088072178] [2023-11-23 07:27:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:27:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:27:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:27:43,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:43,412 INFO L87 Difference]: Start difference. First operand 234 states and 323 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:27:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:27:43,451 INFO L93 Difference]: Finished difference Result 413 states and 561 transitions. [2023-11-23 07:27:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:27:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2023-11-23 07:27:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:27:43,453 INFO L225 Difference]: With dead ends: 413 [2023-11-23 07:27:43,453 INFO L226 Difference]: Without dead ends: 230 [2023-11-23 07:27:43,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:27:43,454 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:27:43,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:27:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-23 07:27:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 222. [2023-11-23 07:27:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.2251655629139073) internal successors, (185), 161 states have internal predecessors, (185), 48 states have call successors, (48), 16 states have call predecessors, (48), 22 states have return successors, (70), 44 states have call predecessors, (70), 45 states have call successors, (70) [2023-11-23 07:27:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 303 transitions. [2023-11-23 07:27:43,473 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 303 transitions. Word has length 84 [2023-11-23 07:27:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:27:43,474 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 303 transitions. [2023-11-23 07:27:43,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:27:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 303 transitions. [2023-11-23 07:27:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:27:43,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:27:43,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:43,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 07:27:43,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:27:43,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:27:43,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:27:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1886676492, now seen corresponding path program 1 times [2023-11-23 07:27:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:27:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690254146] [2023-11-23 07:27:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:27:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:27:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:27:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:27:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:27:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:27:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:27:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:27:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:27:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:44,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:27:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 07:27:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:27:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690254146] [2023-11-23 07:27:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690254146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665500607] [2023-11-23 07:27:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:27:44,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:27:44,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:44,017 INFO L229 MonitoredProcess]: Starting monitored process 15 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:27:44,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 07:27:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:27:44,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-23 07:27:44,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:27:44,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:44,282 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:27:44,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 07:27:44,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:44,295 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 16 treesize of output 11 [2023-11-23 07:27:44,357 INFO L349 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2023-11-23 07:27:44,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 115 [2023-11-23 07:27:44,374 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 28 treesize of output 27 [2023-11-23 07:27:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:44,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:44,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:27:44,387 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 104 treesize of output 52 [2023-11-23 07:27:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 07:27:47,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 07:27:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665500607] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:27:47,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:27:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 8] total 26 [2023-11-23 07:27:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772606134] [2023-11-23 07:27:47,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:47,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 07:27:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 07:27:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=2, NotChecked=0, Total=650 [2023-11-23 07:27:47,885 INFO L87 Difference]: Start difference. First operand 222 states and 303 transitions. Second operand has 26 states, 25 states have (on average 3.96) internal successors, (99), 24 states have internal predecessors, (99), 6 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-23 07:27:50,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:52,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:55,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:57,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:59,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:01,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:03,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:05,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:07,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:09,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:11,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:13,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:15,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:17,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:19,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:21,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:23,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:25,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:28,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:30,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:32,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:32,359 INFO L93 Difference]: Finished difference Result 563 states and 810 transitions. [2023-11-23 07:28:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 07:28:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.96) internal successors, (99), 24 states have internal predecessors, (99), 6 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 86 [2023-11-23 07:28:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:32,361 INFO L225 Difference]: With dead ends: 563 [2023-11-23 07:28:32,361 INFO L226 Difference]: Without dead ends: 369 [2023-11-23 07:28:32,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=327, Invalid=2121, Unknown=2, NotChecked=0, Total=2450 [2023-11-23 07:28:32,362 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 198 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 20 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:32,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 860 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1211 Invalid, 46 Unknown, 0 Unchecked, 43.3s Time] [2023-11-23 07:28:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-11-23 07:28:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 313. [2023-11-23 07:28:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 230 states have (on average 1.2608695652173914) internal successors, (290), 241 states have internal predecessors, (290), 54 states have call successors, (54), 22 states have call predecessors, (54), 28 states have return successors, (82), 49 states have call predecessors, (82), 51 states have call successors, (82) [2023-11-23 07:28:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 426 transitions. [2023-11-23 07:28:32,392 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 426 transitions. Word has length 86 [2023-11-23 07:28:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:32,392 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 426 transitions. [2023-11-23 07:28:32,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.96) internal successors, (99), 24 states have internal predecessors, (99), 6 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-23 07:28:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 426 transitions. [2023-11-23 07:28:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:28:32,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:32,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:32,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:32,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:32,606 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:32,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash -67565236, now seen corresponding path program 1 times [2023-11-23 07:28:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779117063] [2023-11-23 07:28:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:28:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:28:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:28:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 07:28:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779117063] [2023-11-23 07:28:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779117063] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243457361] [2023-11-23 07:28:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:32,697 INFO L229 MonitoredProcess]: Starting monitored process 16 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:28:32,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 07:28:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:32,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:28:32,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:28:32,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243457361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:32,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:32,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:28:32,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274570946] [2023-11-23 07:28:32,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:32,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:28:32,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:32,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:28:32,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:32,898 INFO L87 Difference]: Start difference. First operand 313 states and 426 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:28:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:32,957 INFO L93 Difference]: Finished difference Result 515 states and 741 transitions. [2023-11-23 07:28:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:32,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2023-11-23 07:28:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:32,959 INFO L225 Difference]: With dead ends: 515 [2023-11-23 07:28:32,960 INFO L226 Difference]: Without dead ends: 324 [2023-11-23 07:28:32,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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:32,961 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:32,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 202 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-11-23 07:28:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 313. [2023-11-23 07:28:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 230 states have (on average 1.2478260869565216) internal successors, (287), 241 states have internal predecessors, (287), 54 states have call successors, (54), 22 states have call predecessors, (54), 28 states have return successors, (82), 49 states have call predecessors, (82), 51 states have call successors, (82) [2023-11-23 07:28:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2023-11-23 07:28:32,990 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 86 [2023-11-23 07:28:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:32,990 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2023-11-23 07:28:32,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:28:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2023-11-23 07:28:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:28:32,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:32,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:33,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:33,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 07:28:33,226 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:33,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash -799532662, now seen corresponding path program 1 times [2023-11-23 07:28:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913754400] [2023-11-23 07:28:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:28:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:28:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:28:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 07:28:33,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913754400] [2023-11-23 07:28:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913754400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437006110] [2023-11-23 07:28:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:33,418 INFO L229 MonitoredProcess]: Starting monitored process 17 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:28:33,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 07:28:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:33,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:28:33,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:28:33,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437006110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:33,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:33,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 07:28:33,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759445444] [2023-11-23 07:28:33,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:33,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:28:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:28:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 07:28:33,649 INFO L87 Difference]: Start difference. First operand 313 states and 423 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:28:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:33,715 INFO L93 Difference]: Finished difference Result 564 states and 790 transitions. [2023-11-23 07:28:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:33,716 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2023-11-23 07:28:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:33,717 INFO L225 Difference]: With dead ends: 564 [2023-11-23 07:28:33,717 INFO L226 Difference]: Without dead ends: 281 [2023-11-23 07:28:33,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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:33,719 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:33,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-23 07:28:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 265. [2023-11-23 07:28:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 187 states have (on average 1.2192513368983957) internal successors, (228), 197 states have internal predecessors, (228), 51 states have call successors, (51), 20 states have call predecessors, (51), 26 states have return successors, (76), 47 states have call predecessors, (76), 48 states have call successors, (76) [2023-11-23 07:28:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 355 transitions. [2023-11-23 07:28:33,742 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 355 transitions. Word has length 86 [2023-11-23 07:28:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:33,742 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 355 transitions. [2023-11-23 07:28:33,742 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 07:28:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 355 transitions. [2023-11-23 07:28:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 07:28:33,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:33,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 07:28:33,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-23 07:28:33,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 07:28:33,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:33,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -907773684, now seen corresponding path program 1 times [2023-11-23 07:28:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:33,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167433137] [2023-11-23 07:28:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:28:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:28:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:28:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 07:28:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 07:28:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167433137] [2023-11-23 07:28:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167433137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444436167] [2023-11-23 07:28:34,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:34,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:34,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:34,136 INFO L229 MonitoredProcess]: Starting monitored process 18 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:28:34,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 07:28:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:34,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 07:28:34,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:34,404 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-23 07:28:34,404 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 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 07:28:34,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 07:28:34,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2023-11-23 07:28:34,422 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse2 (select .cse1 .cse3))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (or (and (not .cse0) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_6) .cse2 v_arrayElimArr_15) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3 .cse2)) (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))) (not (= .cse2 0))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) .cse0 (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))))))) is different from true [2023-11-23 07:28:34,435 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse0 .cse1)) (not (= .cse1 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) is different from true [2023-11-23 07:28:34,865 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse5 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)))))))) is different from true [2023-11-23 07:28:35,033 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= .cse7 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) (or (and (not .cse5) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_6) .cse7 v_arrayElimArr_15) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse8 .cse7)) (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))) (not (= .cse7 0))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|)) .cse5 (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse9 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse10 (select .cse12 .cse11))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_6) .cse10 v_arrayElimArr_15) .cse9) .cse11 .cse10) .cse12) (not (= .cse9 .cse10)) (not (= .cse10 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24)))))))) is different from true [2023-11-23 07:28:35,091 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse5 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (.cse13 (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24))) (let ((.cse12 (select .cse11 .cse13))) (let ((.cse10 (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse12))) (or (and .cse10 (not (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|))) (and (not .cse10) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_6) .cse12 v_arrayElimArr_15) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) .cse13 .cse12)) (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))) (not (= .cse12 0)))))))) is different from true [2023-11-23 07:28:35,129 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse5 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse5) .cse7 .cse6) .cse8) (not (= .cse5 .cse6)) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse12 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse11 (select .cse13 .cse14))) (and (not (= .cse11 0)) (not (= .cse11 .cse12)) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse12 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse12) .cse14 .cse11))))))))) is different from true [2023-11-23 07:28:35,646 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse7) .cse8 .cse6) .cse9) (not (= .cse7 .cse6)))))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse10 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse17 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse16 (select .cse18 .cse19))) (and (not (= .cse16 0)) (not (= .cse16 .cse17)) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_6) .cse16 v_arrayElimArr_15) .cse17) .cse19 .cse16))))))))) is different from true [2023-11-23 07:28:35,895 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse7) .cse8 .cse6) .cse9) (not (= .cse7 .cse6)))))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse10 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|)) (.cse18 (+ |c_ULTIMATE.start_aws_linked_list_end_~list#1.offset| 24))) (let ((.cse17 (select .cse16 .cse18))) (let ((.cse15 (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| .cse17))) (or (and .cse15 (not (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|))) (and (not .cse15) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| v_DerPreprocessor_6) .cse17 v_arrayElimArr_15) |c_ULTIMATE.start_aws_linked_list_end_~list#1.base|) .cse18 .cse17)) (= |c_ULTIMATE.start_aws_linked_list_end_~list#1.base| (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))) (not (= .cse17 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse21 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse20 (select .cse22 .cse23))) (and (not (= .cse20 0)) (not (= .cse20 .cse21)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_6) .cse20 v_arrayElimArr_15) .cse21) .cse23 .cse20))))))))) is different from true [2023-11-23 07:28:36,017 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse7) .cse8 .cse6) .cse9) (not (= .cse7 .cse6)))))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse10 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse18 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse18 v_DerPreprocessor_6) .cse16 v_arrayElimArr_15) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse22 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 0)) (not (= .cse21 .cse22)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_6) .cse21 v_arrayElimArr_15) .cse22) .cse24 .cse21))))))))) is different from true [2023-11-23 07:28:36,140 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse7) .cse8 .cse6) .cse9) (not (= .cse7 .cse6)))))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse10 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse18 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse18 v_DerPreprocessor_6) .cse16 v_arrayElimArr_15) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse22 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 0)) (not (= .cse21 .cse22)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_6) .cse21 v_arrayElimArr_15) .cse22) .cse24 .cse21))))))))) is different from true [2023-11-23 07:28:36,704 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse0 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24))) (let ((.cse1 (select .cse3 .cse2))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_15) .cse0) .cse2 .cse1) .cse3) (not (= .cse1 0)) (not (= .cse1 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|))) (and (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_51| 24)) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_64|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_24| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_20| 24))) (let ((.cse6 (select .cse9 .cse8))) (and (not (= .cse6 0)) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse6 v_arrayElimArr_15) .cse7) .cse8 .cse6) .cse9) (not (= .cse7 .cse6)))))))) (or (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse10 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_6) .cse11 v_arrayElimArr_15) .cse10) .cse12 .cse11) .cse13) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63|)) (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_63| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset_BEFORE_CALL_50| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_25| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|)))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse18 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_21| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse18 v_DerPreprocessor_6) .cse16 v_arrayElimArr_15) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) |c_aws_linked_list_is_valid_#t~short312#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_23| 0))))) (exists ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31| Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse22 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_31|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 0)) (not (= .cse21 .cse22)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_6) .cse21 v_arrayElimArr_15) .cse22) .cse24 .cse21))))))))) is different from true [2023-11-23 07:28:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 37 not checked. [2023-11-23 07:28:37,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:37,429 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 07:28:37,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2023-11-23 07:28:37,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-11-23 07:28:37,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:37,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 99 treesize of output 115 [2023-11-23 07:28:37,487 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 6 treesize of output 4 [2023-11-23 07:28:37,515 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:28:37,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:37,521 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 36 treesize of output 40 [2023-11-23 07:28:37,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:37,549 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 32 treesize of output 36 [2023-11-23 07:28:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:28:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444436167] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 29 [2023-11-23 07:28:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350069654] [2023-11-23 07:28:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:37,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 07:28:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 07:28:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=255, Unknown=28, NotChecked=462, Total=812 [2023-11-23 07:28:37,576 INFO L87 Difference]: Start difference. First operand 265 states and 355 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:28:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:37,950 INFO L93 Difference]: Finished difference Result 421 states and 566 transitions. [2023-11-23 07:28:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:28:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 87 [2023-11-23 07:28:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:37,952 INFO L225 Difference]: With dead ends: 421 [2023-11-23 07:28:37,952 INFO L226 Difference]: Without dead ends: 265 [2023-11-23 07:28:37,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=347, Unknown=32, NotChecked=528, Total=992 [2023-11-23 07:28:37,953 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 28 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:37,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 383 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:28:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-23 07:28:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2023-11-23 07:28:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 187 states have (on average 1.2085561497326203) internal successors, (226), 197 states have internal predecessors, (226), 51 states have call successors, (51), 20 states have call predecessors, (51), 26 states have return successors, (76), 47 states have call predecessors, (76), 48 states have call successors, (76) [2023-11-23 07:28:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 353 transitions. [2023-11-23 07:28:37,977 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 353 transitions. Word has length 87 [2023-11-23 07:28:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:37,977 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 353 transitions. [2023-11-23 07:28:37,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 07:28:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 353 transitions. [2023-11-23 07:28:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-23 07:28:37,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:37,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:37,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:38,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 07:28:38,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:38,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 122141960, now seen corresponding path program 1 times [2023-11-23 07:28:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596120523] [2023-11-23 07:28:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:28:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:28:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 07:28:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 07:28:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 07:28:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596120523] [2023-11-23 07:28:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596120523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80453685] [2023-11-23 07:28:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:38,395 INFO L229 MonitoredProcess]: Starting monitored process 19 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:28:38,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 07:28:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:38,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-23 07:28:38,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,671 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:28:38,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,684 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:28:38,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,759 INFO L349 Elim1Store]: treesize reduction 72, result has 8.9 percent of original size [2023-11-23 07:28:38,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 120 [2023-11-23 07:28:38,818 INFO L349 Elim1Store]: treesize reduction 112, result has 20.6 percent of original size [2023-11-23 07:28:38,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 506 treesize of output 481 [2023-11-23 07:28:38,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:38,861 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2023-11-23 07:28:38,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 168 [2023-11-23 07:28:39,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:39,030 INFO L349 Elim1Store]: treesize reduction 41, result has 35.9 percent of original size [2023-11-23 07:28:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 70 [2023-11-23 07:28:39,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:39,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-23 07:28:39,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:39,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:39,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2023-11-23 07:28:39,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-11-23 07:28:39,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 54 [2023-11-23 07:28:39,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:39,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-23 07:28:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:28:39,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:40,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:28:40,407 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2023-11-23 07:28:40,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 101 [2023-11-23 07:28:40,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 394 treesize of output 390 [2023-11-23 07:28:40,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:40,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 289 [2023-11-23 07:28:40,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:40,707 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 110 treesize of output 114 [2023-11-23 07:28:41,645 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 6 treesize of output 4 [2023-11-23 07:28:42,277 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 6 treesize of output 4 [2023-11-23 07:28:42,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:28:42,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:28:42,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 863 treesize of output 895 [2023-11-23 07:28:46,828 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 6 treesize of output 4 [2023-11-23 07:28:46,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 07:28:46,839 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 7 treesize of output 5 [2023-11-23 07:28:46,841 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:28:46,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:46,850 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 75 treesize of output 67 [2023-11-23 07:28:46,854 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 76 treesize of output 70 [2023-11-23 07:28:46,889 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:28:46,892 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 6 treesize of output 4 [2023-11-23 07:28:46,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:46,907 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 07:28:46,908 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 20 treesize of output 17 [2023-11-23 07:28:46,918 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 6 treesize of output 4 [2023-11-23 07:28:46,922 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 19 treesize of output 13 [2023-11-23 07:28:46,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:46,993 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 56 treesize of output 52 [2023-11-23 07:28:47,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-11-23 07:28:47,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:47,025 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 11 treesize of output 9 [2023-11-23 07:28:47,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-11-23 07:28:47,079 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-23 07:28:47,079 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 101 treesize of output 98 [2023-11-23 07:28:47,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:28:47,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-11-23 07:28:47,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:47,157 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 07:28:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:28:47,168 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-11-23 07:28:47,173 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 07:28:47,189 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:28:47,189 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 20 treesize of output 14 [2023-11-23 07:28:47,205 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 07:28:47,205 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 25 treesize of output 1 [2023-11-23 07:28:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:28:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80453685] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:28:47,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:28:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 11] total 26 [2023-11-23 07:28:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377440227] [2023-11-23 07:28:47,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:28:47,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 07:28:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:47,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 07:28:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-11-23 07:28:47,416 INFO L87 Difference]: Start difference. First operand 265 states and 353 transitions. Second operand has 26 states, 23 states have (on average 5.130434782608695) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) [2023-11-23 07:28:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:49,071 INFO L93 Difference]: Finished difference Result 457 states and 628 transitions. [2023-11-23 07:28:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 07:28:49,072 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.130434782608695) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) Word has length 87 [2023-11-23 07:28:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:49,073 INFO L225 Difference]: With dead ends: 457 [2023-11-23 07:28:49,073 INFO L226 Difference]: Without dead ends: 291 [2023-11-23 07:28:49,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=1657, Unknown=0, NotChecked=0, Total=1892 [2023-11-23 07:28:49,074 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 141 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:49,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 935 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 07:28:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-23 07:28:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2023-11-23 07:28:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 196 states have (on average 1.2142857142857142) internal successors, (238), 205 states have internal predecessors, (238), 51 states have call successors, (51), 20 states have call predecessors, (51), 27 states have return successors, (77), 49 states have call predecessors, (77), 48 states have call successors, (77) [2023-11-23 07:28:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 366 transitions. [2023-11-23 07:28:49,158 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 366 transitions. Word has length 87 [2023-11-23 07:28:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:49,158 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 366 transitions. [2023-11-23 07:28:49,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.130434782608695) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 9 states have call successors, (25) [2023-11-23 07:28:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 366 transitions. [2023-11-23 07:28:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 07:28:49,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:49,159 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:49,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:49,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:49,372 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:49,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1816618516, now seen corresponding path program 1 times [2023-11-23 07:28:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735282515] [2023-11-23 07:28:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:28:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:28:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:28:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:28:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:28:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:28:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735282515] [2023-11-23 07:28:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735282515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285725004] [2023-11-23 07:28:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:49,786 INFO L229 MonitoredProcess]: Starting monitored process 20 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:28:49,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-23 07:28:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:50,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 144 conjunts are in the unsatisfiable core [2023-11-23 07:28:50,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:50,083 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 14 treesize of output 15 [2023-11-23 07:28:50,088 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 14 treesize of output 15 [2023-11-23 07:28:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 37 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 07:28:51,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:59,760 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 8)))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 8))))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) 8))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)))) (= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) is different from false [2023-11-23 07:29:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-11-23 07:29:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285725004] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:29:00,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:29:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24, 28] total 55 [2023-11-23 07:29:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654831004] [2023-11-23 07:29:00,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:29:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 07:29:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:29:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 07:29:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2646, Unknown=3, NotChecked=104, Total=2970 [2023-11-23 07:29:00,265 INFO L87 Difference]: Start difference. First operand 275 states and 366 transitions. Second operand has 55 states, 49 states have (on average 3.163265306122449) internal successors, (155), 46 states have internal predecessors, (155), 14 states have call successors, (26), 4 states have call predecessors, (26), 13 states have return successors, (25), 15 states have call predecessors, (25), 14 states have call successors, (25) [2023-11-23 07:29:04,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 07:29:06,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| c_aws_linked_list_node_next_is_valid_~node.base) c_aws_linked_list_node_next_is_valid_~node.offset) 8)) (.cse7 (= (select (select |c_#memory_$Pointer$#1.base| .cse10) .cse11) |c_aws_linked_list_node_next_is_valid_#in~node.base|)) (.cse4 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse10) .cse11)))) (let ((.cse0 (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 8)))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 8)))))) (.cse1 (and .cse7 .cse4)) (.cse3 (= c_aws_linked_list_node_next_is_valid_~node.base (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9))) (.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9) c_aws_linked_list_node_next_is_valid_~node.offset))) (and (or .cse0 (not |c_aws_linked_list_node_next_is_valid_#t~short318|) .cse1) (or (not .cse2) .cse0 (not .cse3) .cse1) (or (not .cse4) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)) (.cse6 (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (or (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.offset| .cse5) .cse6))) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse5) .cse6)))))) (and .cse3 .cse2) (not .cse7)))))) is different from false [2023-11-23 07:29:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:29:12,479 INFO L93 Difference]: Finished difference Result 595 states and 826 transitions. [2023-11-23 07:29:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-23 07:29:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 49 states have (on average 3.163265306122449) internal successors, (155), 46 states have internal predecessors, (155), 14 states have call successors, (26), 4 states have call predecessors, (26), 13 states have return successors, (25), 15 states have call predecessors, (25), 14 states have call successors, (25) Word has length 104 [2023-11-23 07:29:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:29:12,481 INFO L225 Difference]: With dead ends: 595 [2023-11-23 07:29:12,481 INFO L226 Difference]: Without dead ends: 379 [2023-11-23 07:29:12,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3013 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=1162, Invalid=10614, Unknown=4, NotChecked=430, Total=12210 [2023-11-23 07:29:12,486 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 467 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 194 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 453 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:29:12,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1654 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2383 Invalid, 1 Unknown, 453 Unchecked, 5.0s Time] [2023-11-23 07:29:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-23 07:29:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 282. [2023-11-23 07:29:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 200 states have (on average 1.21) internal successors, (242), 211 states have internal predecessors, (242), 51 states have call successors, (51), 20 states have call predecessors, (51), 30 states have return successors, (76), 50 states have call predecessors, (76), 48 states have call successors, (76) [2023-11-23 07:29:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 369 transitions. [2023-11-23 07:29:12,528 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 369 transitions. Word has length 104 [2023-11-23 07:29:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:29:12,529 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 369 transitions. [2023-11-23 07:29:12,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 49 states have (on average 3.163265306122449) internal successors, (155), 46 states have internal predecessors, (155), 14 states have call successors, (26), 4 states have call predecessors, (26), 13 states have return successors, (25), 15 states have call predecessors, (25), 14 states have call successors, (25) [2023-11-23 07:29:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 369 transitions. [2023-11-23 07:29:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 07:29:12,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:29:12,530 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 07:29:12,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-23 07:29:12,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:12,743 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:29:12,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:29:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 563856749, now seen corresponding path program 1 times [2023-11-23 07:29:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:29:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819118833] [2023-11-23 07:29:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:29:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:29:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:29:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:29:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:29:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:29:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:29:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:29:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 07:29:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 07:29:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:29:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 07:29:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:29:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819118833] [2023-11-23 07:29:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819118833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:29:13,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983409391] [2023-11-23 07:29:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:29:13,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:29:13,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:29:13,344 INFO L229 MonitoredProcess]: Starting monitored process 21 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:29:13,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-23 07:29:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:29:13,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 07:29:13,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:29:13,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-23 07:30:16,418 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_32| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_36|))) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_36| (select .cse0 |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_32|)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_36| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_end_~list#1.offset_BEFORE_CALL_32| 24))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_36|)))) is different from true Killed by 15