./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness_negated.i --full-output --preprocessor.use.memory.slicer false --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_pop_front_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 b1e7e8a09eec10e16cdff37c367e29c34d699711a041162be9d9f7371d588669 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:52:11,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:52:11,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:52:11,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:52:11,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:52:11,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:52:11,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:52:11,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:52:11,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:52:11,841 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:52:11,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:52:11,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:52:11,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:52:11,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:52:11,844 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:52:11,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:52:11,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:52:11,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:52:11,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:52:11,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:52:11,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:52:11,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:52:11,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:52:11,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:52:11,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:52:11,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:52:11,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:52:11,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:52:11,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:11,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:52:11,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:52:11,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:52:11,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:52:11,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:52:11,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:52:11,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:52:11,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:52:11,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:52:11,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:52:11,853 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 -> b1e7e8a09eec10e16cdff37c367e29c34d699711a041162be9d9f7371d588669 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:52:12,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:52:12,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:52:12,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:52:12,219 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:52:12,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:52:12,221 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_pop_front_harness_negated.i [2023-11-23 08:52:13,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:52:13,912 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:52:13,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness_negated.i [2023-11-23 08:52:13,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa3533e0/b5cac579578c411c9e5865838646ce82/FLAGe5ae76135 [2023-11-23 08:52:13,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa3533e0/b5cac579578c411c9e5865838646ce82 [2023-11-23 08:52:13,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:52:13,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:52:13,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:13,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:52:13,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:52:13,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:13" (1/1) ... [2023-11-23 08:52:13,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec616b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:13, skipping insertion in model container [2023-11-23 08:52:13,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:13" (1/1) ... [2023-11-23 08:52:14,083 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:52:14,378 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_pop_front_harness_negated.i[4499,4512] [2023-11-23 08:52:14,385 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_pop_front_harness_negated.i[4559,4572] [2023-11-23 08:52:15,142 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,143 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,144 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,154 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,167 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,175 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,178 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,180 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,181 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,184 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,184 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,397 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:15,398 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:15,400 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:15,401 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:15,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:15,403 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:15,403 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:15,404 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:15,404 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:15,405 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:15,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:15,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:52:15,549 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_pop_front_harness_negated.i[4499,4512] [2023-11-23 08:52:15,549 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_pop_front_harness_negated.i[4559,4572] [2023-11-23 08:52:15,609 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,610 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,610 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,610 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,611 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,633 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,634 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,634 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,635 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,636 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:15,685 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:15,686 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:15,687 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:15,688 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:15,693 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:15,694 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:15,695 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:15,696 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:15,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:15,698 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:15,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:15,910 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,912 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,912 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,912 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,913 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,913 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,913 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,914 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,914 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,914 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,914 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,914 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,915 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,915 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,915 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,915 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:15,922 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:52:15,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15 WrapperNode [2023-11-23 08:52:15,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:15,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:15,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:52:15,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:52:15,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,073 INFO L138 Inliner]: procedures = 678, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2023-11-23 08:52:16,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:16,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:52:16,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:52:16,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:52:16,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:52:16,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:52:16,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:52:16,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:52:16,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (1/1) ... [2023-11-23 08:52:16,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:16,185 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 08:52:16,210 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 08:52:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-23 08:52:16,245 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-23 08:52:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-23 08:52:16,245 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-23 08:52:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:52:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:52:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:52:16,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:52:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:16,246 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:52:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:52:16,246 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:52:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:52:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:52:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:52:16,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:52:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 08:52:16,247 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 08:52:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-23 08:52:16,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-23 08:52:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:52:16,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:52:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:52:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:52:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:52:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:52:16,249 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:52:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:16,249 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:52:16,487 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:52:16,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:52:16,844 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:52:16,905 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:52:16,905 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 08:52:16,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:16 BoogieIcfgContainer [2023-11-23 08:52:16,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:52:16,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:52:16,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:52:16,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:52:16,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:13" (1/3) ... [2023-11-23 08:52:16,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76dcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:16, skipping insertion in model container [2023-11-23 08:52:16,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15" (2/3) ... [2023-11-23 08:52:16,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f76dcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:16, skipping insertion in model container [2023-11-23 08:52:16,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:16" (3/3) ... [2023-11-23 08:52:16,918 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness_negated.i [2023-11-23 08:52:16,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:52:16,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:52:16,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:52:16,988 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;@77539c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:52:16,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:52:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-23 08:52:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:17,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:17,004 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:17,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:17,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash -558738616, now seen corresponding path program 1 times [2023-11-23 08:52:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200579359] [2023-11-23 08:52:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2023-11-23 08:52:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200579359] [2023-11-23 08:52:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200579359] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401547468] [2023-11-23 08:52:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:17,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:18,001 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 08:52:18,030 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 08:52:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:52:18,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-23 08:52:18,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401547468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:52:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243744077] [2023-11-23 08:52:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:18,327 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:52:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:18,458 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2023-11-23 08:52:18,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2023-11-23 08:52:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:18,471 INFO L225 Difference]: With dead ends: 244 [2023-11-23 08:52:18,472 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 08:52:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 08:52:18,483 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:18,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 446 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:52:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 08:52:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2023-11-23 08:52:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 74 states have internal predecessors, (94), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 08:52:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2023-11-23 08:52:18,585 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 110 [2023-11-23 08:52:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:18,586 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2023-11-23 08:52:18,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:52:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2023-11-23 08:52:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:18,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:18,594 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:18,616 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 08:52:18,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 08:52:18,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:18,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 112415754, now seen corresponding path program 1 times [2023-11-23 08:52:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:18,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314708816] [2023-11-23 08:52:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-11-23 08:52:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314708816] [2023-11-23 08:52:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314708816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665037459] [2023-11-23 08:52:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:19,155 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 08:52:19,175 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 08:52:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:19,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:52:19,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-23 08:52:19,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665037459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:52:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423930278] [2023-11-23 08:52:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:19,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:19,374 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:52:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:19,443 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2023-11-23 08:52:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2023-11-23 08:52:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:19,451 INFO L225 Difference]: With dead ends: 230 [2023-11-23 08:52:19,451 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:52:19,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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 08:52:19,455 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:19,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 442 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:52:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-11-23 08:52:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 08:52:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2023-11-23 08:52:19,469 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 110 [2023-11-23 08:52:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:19,474 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2023-11-23 08:52:19,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:52:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2023-11-23 08:52:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:19,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:19,476 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:19,516 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 08:52:19,693 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,SelfDestructingSolverStorable1 [2023-11-23 08:52:19,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:19,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 287415628, now seen corresponding path program 1 times [2023-11-23 08:52:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001323130] [2023-11-23 08:52:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-11-23 08:52:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001323130] [2023-11-23 08:52:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001323130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322566287] [2023-11-23 08:52:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:20,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:20,782 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 08:52:20,804 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 08:52:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:20,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-23 08:52:20,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:21,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:52:21,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-11-23 08:52:22,054 INFO L349 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2023-11-23 08:52:22,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 39 [2023-11-23 08:52:22,066 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-23 08:52:22,066 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 17 treesize of output 7 [2023-11-23 08:52:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 106 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-23 08:52:22,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:23,077 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 170 treesize of output 162 [2023-11-23 08:52:23,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:23,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:23,134 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 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-23 08:52:23,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-23 08:52:23,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:52:23,159 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-23 08:52:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-23 08:52:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322566287] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:52:23,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:52:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 31 [2023-11-23 08:52:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377790290] [2023-11-23 08:52:23,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:52:23,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:52:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:52:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2023-11-23 08:52:23,308 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 31 states, 25 states have (on average 3.36) internal successors, (84), 28 states have internal predecessors, (84), 16 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (38), 14 states have call predecessors, (38), 16 states have call successors, (38) [2023-11-23 08:52:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:26,220 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2023-11-23 08:52:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 08:52:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 3.36) internal successors, (84), 28 states have internal predecessors, (84), 16 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (38), 14 states have call predecessors, (38), 16 states have call successors, (38) Word has length 110 [2023-11-23 08:52:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:26,224 INFO L225 Difference]: With dead ends: 266 [2023-11-23 08:52:26,225 INFO L226 Difference]: Without dead ends: 142 [2023-11-23 08:52:26,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=173, Invalid=1719, Unknown=0, NotChecked=0, Total=1892 [2023-11-23 08:52:26,227 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:26,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2910 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 08:52:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-23 08:52:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2023-11-23 08:52:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 78 states have internal predecessors, (98), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 08:52:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 171 transitions. [2023-11-23 08:52:26,258 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 171 transitions. Word has length 110 [2023-11-23 08:52:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:26,258 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 171 transitions. [2023-11-23 08:52:26,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 3.36) internal successors, (84), 28 states have internal predecessors, (84), 16 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (38), 14 states have call predecessors, (38), 16 states have call successors, (38) [2023-11-23 08:52:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 171 transitions. [2023-11-23 08:52:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-23 08:52:26,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:26,261 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:26,288 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 08:52:26,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:26,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:26,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -212166816, now seen corresponding path program 1 times [2023-11-23 08:52:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843681174] [2023-11-23 08:52:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:52:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:52:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:52:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:52:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:52:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:52:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:52:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:52:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:52:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-23 08:52:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843681174] [2023-11-23 08:52:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843681174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802473648] [2023-11-23 08:52:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:27,284 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 08:52:27,364 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 08:52:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 08:52:27,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:27,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:52:27,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:52:27,766 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:52:27,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:52:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 08:52:27,865 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 08:52:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 97 [2023-11-23 08:52:27,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 77 treesize of output 54 [2023-11-23 08:52:27,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2023-11-23 08:52:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 112 proven. 21 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 08:52:57,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:58,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int)) (v_ArrVal_303 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_302))) (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|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_303))) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset|) 0))) is different from false [2023-11-23 08:52:58,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:58,283 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2023-11-23 08:52:58,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:58,300 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 188 treesize of output 188 [2023-11-23 08:52:58,308 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 176 treesize of output 168 [2023-11-23 08:52:58,407 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 08:52:58,426 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 24 treesize of output 22 [2023-11-23 08:52:58,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:58,438 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 72 treesize of output 70 [2023-11-23 08:53:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802473648] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:02,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:02,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 18 [2023-11-23 08:53:02,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802105611] [2023-11-23 08:53:02,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:02,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 08:53:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 08:53:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=616, Unknown=6, NotChecked=50, Total=756 [2023-11-23 08:53:02,778 INFO L87 Difference]: Start difference. First operand 125 states and 171 transitions. Second operand has 18 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2023-11-23 08:53:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:07,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:09,477 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 08:53:11,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:14,779 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] [2023-11-23 08:53:17,139 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 08:53:19,343 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 08:53:21,427 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 08:53:23,661 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 08:53:25,783 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 08:53:27,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:29,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:31,968 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 08:53:33,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:53:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:34,157 INFO L93 Difference]: Finished difference Result 339 states and 469 transitions. [2023-11-23 08:53:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 08:53:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) Word has length 111 [2023-11-23 08:53:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:34,160 INFO L225 Difference]: With dead ends: 339 [2023-11-23 08:53:34,160 INFO L226 Difference]: Without dead ends: 222 [2023-11-23 08:53:34,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 212 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=273, Invalid=1887, Unknown=6, NotChecked=90, Total=2256 [2023-11-23 08:53:34,162 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 244 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 76 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:34,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 2034 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1350 Invalid, 14 Unknown, 0 Unchecked, 30.7s Time] [2023-11-23 08:53:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-23 08:53:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211. [2023-11-23 08:53:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 136 states have internal predecessors, (168), 60 states have call successors, (60), 17 states have call predecessors, (60), 18 states have return successors, (65), 57 states have call predecessors, (65), 59 states have call successors, (65) [2023-11-23 08:53:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2023-11-23 08:53:34,199 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 293 transitions. Word has length 111 [2023-11-23 08:53:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:34,199 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 293 transitions. [2023-11-23 08:53:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2023-11-23 08:53:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 293 transitions. [2023-11-23 08:53:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 08:53:34,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:34,201 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:34,220 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 08:53:34,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:34,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:34,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1067022302, now seen corresponding path program 1 times [2023-11-23 08:53:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47255486] [2023-11-23 08:53:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:53:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:53:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:53:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:53:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 08:53:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:53:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-11-23 08:53:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47255486] [2023-11-23 08:53:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47255486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479541100] [2023-11-23 08:53:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:34,756 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 08:53:34,757 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 08:53:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:34,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:53:34,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-23 08:53:35,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479541100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:35,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:35,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:53:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019893670] [2023-11-23 08:53:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:35,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:53:35,055 INFO L87 Difference]: Start difference. First operand 211 states and 293 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:53:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:35,252 INFO L93 Difference]: Finished difference Result 402 states and 559 transitions. [2023-11-23 08:53:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:35,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2023-11-23 08:53:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:35,254 INFO L225 Difference]: With dead ends: 402 [2023-11-23 08:53:35,254 INFO L226 Difference]: Without dead ends: 217 [2023-11-23 08:53:35,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:53:35,256 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 54 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:35,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 714 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-23 08:53:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2023-11-23 08:53:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 135 states have (on average 1.2666666666666666) internal successors, (171), 140 states have internal predecessors, (171), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (67), 57 states have call predecessors, (67), 59 states have call successors, (67) [2023-11-23 08:53:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2023-11-23 08:53:35,282 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 113 [2023-11-23 08:53:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:35,283 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2023-11-23 08:53:35,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:53:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2023-11-23 08:53:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 08:53:35,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:35,285 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:35,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:35,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:35,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1960232431, now seen corresponding path program 1 times [2023-11-23 08:53:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887838455] [2023-11-23 08:53:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:53:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:53:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:53:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 08:53:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:53:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:53:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-23 08:53:35,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:35,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887838455] [2023-11-23 08:53:35,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887838455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:35,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517259156] [2023-11-23 08:53:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:35,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:35,868 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 08:53:35,870 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 08:53:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 08:53:36,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-23 08:53:36,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517259156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:36,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:36,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2023-11-23 08:53:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747699881] [2023-11-23 08:53:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:53:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:53:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:53:36,140 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:53:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:36,385 INFO L93 Difference]: Finished difference Result 426 states and 594 transitions. [2023-11-23 08:53:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:53:36,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2023-11-23 08:53:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:36,387 INFO L225 Difference]: With dead ends: 426 [2023-11-23 08:53:36,387 INFO L226 Difference]: Without dead ends: 237 [2023-11-23 08:53:36,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:53:36,389 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 78 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:36,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 831 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-23 08:53:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 219. [2023-11-23 08:53:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 144 states have internal predecessors, (177), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (67), 57 states have call predecessors, (67), 59 states have call successors, (67) [2023-11-23 08:53:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 304 transitions. [2023-11-23 08:53:36,407 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 304 transitions. Word has length 115 [2023-11-23 08:53:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:36,407 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 304 transitions. [2023-11-23 08:53:36,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:53:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 304 transitions. [2023-11-23 08:53:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 08:53:36,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:36,409 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:36,430 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 08:53:36,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:36,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:36,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1957092525, now seen corresponding path program 1 times [2023-11-23 08:53:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667230858] [2023-11-23 08:53:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:53:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:53:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:53:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:53:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:53:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 08:53:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-23 08:53:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667230858] [2023-11-23 08:53:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667230858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696939479] [2023-11-23 08:53:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:36,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:36,952 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 08:53:36,974 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 08:53:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:53:37,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-23 08:53:37,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:37,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696939479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:37,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:37,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-23 08:53:37,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347014937] [2023-11-23 08:53:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:37,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:53:37,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:53:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:37,167 INFO L87 Difference]: Start difference. First operand 219 states and 304 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:53:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:37,220 INFO L93 Difference]: Finished difference Result 422 states and 593 transitions. [2023-11-23 08:53:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:53:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2023-11-23 08:53:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:37,224 INFO L225 Difference]: With dead ends: 422 [2023-11-23 08:53:37,224 INFO L226 Difference]: Without dead ends: 229 [2023-11-23 08:53:37,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:37,226 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:37,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 292 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-23 08:53:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2023-11-23 08:53:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 146 states have internal predecessors, (179), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (67), 57 states have call predecessors, (67), 59 states have call successors, (67) [2023-11-23 08:53:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2023-11-23 08:53:37,252 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 116 [2023-11-23 08:53:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:37,253 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2023-11-23 08:53:37,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-23 08:53:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2023-11-23 08:53:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 08:53:37,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:37,255 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 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 08:53:37,271 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 08:53:37,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:37,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:37,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash 32364141, now seen corresponding path program 1 times [2023-11-23 08:53:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:37,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233593285] [2023-11-23 08:53:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:53:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:53:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:53:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:53:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:53:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:53:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-23 08:53:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233593285] [2023-11-23 08:53:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233593285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155244831] [2023-11-23 08:53:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:37,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:37,838 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 08:53:37,855 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 08:53:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:38,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-23 08:53:38,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:38,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:53:38,160 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 08:53:38,175 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 08:53:38,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,223 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 08:53:38,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,229 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 08:53:38,243 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:38,244 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 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-23 08:53:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,255 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 13 treesize of output 7 [2023-11-23 08:53:38,282 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:38,284 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 1 case distinctions, treesize of input 27 treesize of output 24 [2023-11-23 08:53:38,295 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 15 treesize of output 7 [2023-11-23 08:53:38,311 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:53:38,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:53:38,402 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 08:53:38,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 157 [2023-11-23 08:53:38,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:38,410 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 137 treesize of output 113 [2023-11-23 08:53:38,416 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 08:53:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 24 [2023-11-23 08:53:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 112 proven. 21 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-23 08:53:41,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:41,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:41,928 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 93 treesize of output 92 [2023-11-23 08:53:41,962 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 08:53:42,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:42,141 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:42,210 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:53:42,211 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 181 treesize of output 210 [2023-11-23 08:53:42,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:42,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:42,296 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:53:42,296 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 231 treesize of output 260 [2023-11-23 08:53:42,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:42,326 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 288 treesize of output 274 [2023-11-23 08:53:42,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:42,348 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 318 treesize of output 316 [2023-11-23 08:53:42,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:42,382 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 275 treesize of output 272 [2023-11-23 08:53:42,417 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 285 treesize of output 273 [2023-11-23 08:53:44,210 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 08:53:44,268 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 08:53:45,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:45,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:45,460 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 357 treesize of output 359 [2023-11-23 08:53:47,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:47,987 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 1519 treesize of output 1357 [2023-11-23 08:53:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155244831] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:51,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:51,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 18 [2023-11-23 08:53:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716777659] [2023-11-23 08:53:51,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:51,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 08:53:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 08:53:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=613, Unknown=13, NotChecked=0, Total=702 [2023-11-23 08:53:51,147 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand has 18 states, 16 states have (on average 6.75) internal successors, (108), 17 states have internal predecessors, (108), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2023-11-23 08:53:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:53,887 INFO L93 Difference]: Finished difference Result 439 states and 604 transitions. [2023-11-23 08:53:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:53:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.75) internal successors, (108), 17 states have internal predecessors, (108), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 123 [2023-11-23 08:53:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:53,890 INFO L225 Difference]: With dead ends: 439 [2023-11-23 08:53:53,890 INFO L226 Difference]: Without dead ends: 242 [2023-11-23 08:53:53,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 15 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=244, Invalid=1905, Unknown=13, NotChecked=0, Total=2162 [2023-11-23 08:53:53,892 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 284 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:53,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1406 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-23 08:53:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-23 08:53:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 226. [2023-11-23 08:53:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 60 states have call successors, (60), 18 states have call predecessors, (60), 20 states have return successors, (67), 57 states have call predecessors, (67), 59 states have call successors, (67) [2023-11-23 08:53:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 309 transitions. [2023-11-23 08:53:53,918 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 309 transitions. Word has length 123 [2023-11-23 08:53:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:53,919 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 309 transitions. [2023-11-23 08:53:53,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.75) internal successors, (108), 17 states have internal predecessors, (108), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2023-11-23 08:53:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 309 transitions. [2023-11-23 08:53:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 08:53:53,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:53,921 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:53,937 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 08:53:54,137 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,SelfDestructingSolverStorable7 [2023-11-23 08:53:54,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:54,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash -220012384, now seen corresponding path program 1 times [2023-11-23 08:53:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694917851] [2023-11-23 08:53:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:54,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:53:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:53:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:53:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:53:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:53:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 08:53:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-11-23 08:53:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694917851] [2023-11-23 08:53:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694917851] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755150356] [2023-11-23 08:53:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:54,700 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 08:53:54,702 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 08:53:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:54,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-23 08:53:54,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:54,984 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 13 treesize of output 1 [2023-11-23 08:53:54,987 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 13 treesize of output 1 [2023-11-23 08:53:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 109 proven. 11 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-23 08:53:55,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-23 08:53:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755150356] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:53:56,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:53:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 10] total 31 [2023-11-23 08:53:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926713056] [2023-11-23 08:53:56,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:56,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:53:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:53:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2023-11-23 08:53:56,018 INFO L87 Difference]: Start difference. First operand 226 states and 309 transitions. Second operand has 31 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 8 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-11-23 08:53:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:57,830 INFO L93 Difference]: Finished difference Result 483 states and 689 transitions. [2023-11-23 08:53:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-23 08:53:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 8 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 125 [2023-11-23 08:53:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:57,833 INFO L225 Difference]: With dead ends: 483 [2023-11-23 08:53:57,833 INFO L226 Difference]: Without dead ends: 287 [2023-11-23 08:53:57,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=340, Invalid=2416, Unknown=0, NotChecked=0, Total=2756 [2023-11-23 08:53:57,835 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 233 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:57,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 2352 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 08:53:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-23 08:53:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2023-11-23 08:53:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 164 states have internal predecessors, (194), 62 states have call successors, (62), 20 states have call predecessors, (62), 22 states have return successors, (75), 57 states have call predecessors, (75), 61 states have call successors, (75) [2023-11-23 08:53:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 331 transitions. [2023-11-23 08:53:57,868 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 331 transitions. Word has length 125 [2023-11-23 08:53:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:57,869 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 331 transitions. [2023-11-23 08:53:57,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 8 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-11-23 08:53:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 331 transitions. [2023-11-23 08:53:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-23 08:53:57,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:57,871 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:57,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:58,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:58,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:58,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1244565634, now seen corresponding path program 1 times [2023-11-23 08:53:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679139242] [2023-11-23 08:53:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:53:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:53:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:53:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:53:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:53:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 08:53:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-11-23 08:53:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679139242] [2023-11-23 08:53:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679139242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710789782] [2023-11-23 08:53:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:58,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:58,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:58,409 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 08:53:58,431 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 08:53:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:58,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 08:53:58,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-23 08:53:58,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-11-23 08:53:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710789782] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 12] total 18 [2023-11-23 08:53:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027159683] [2023-11-23 08:53:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:53:58,866 INFO L87 Difference]: Start difference. First operand 242 states and 331 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 08:53:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:58,975 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2023-11-23 08:53:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-23 08:53:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:58,977 INFO L225 Difference]: With dead ends: 260 [2023-11-23 08:53:58,977 INFO L226 Difference]: Without dead ends: 258 [2023-11-23 08:53:58,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:53:58,978 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 6 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:58,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 726 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-23 08:53:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2023-11-23 08:53:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 165 states have (on average 1.2242424242424241) internal successors, (202), 174 states have internal predecessors, (202), 64 states have call successors, (64), 22 states have call predecessors, (64), 26 states have return successors, (83), 59 states have call predecessors, (83), 63 states have call successors, (83) [2023-11-23 08:53:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 349 transitions. [2023-11-23 08:53:59,015 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 349 transitions. Word has length 126 [2023-11-23 08:53:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:59,015 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 349 transitions. [2023-11-23 08:53:59,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 08:53:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 349 transitions. [2023-11-23 08:53:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-23 08:53:59,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:59,018 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 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 08:53:59,031 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 08:53:59,220 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,SelfDestructingSolverStorable9 [2023-11-23 08:53:59,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:59,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1207547708, now seen corresponding path program 1 times [2023-11-23 08:53:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447989577] [2023-11-23 08:53:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:53:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:53:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:53:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:53:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:53:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 08:53:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-23 08:53:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447989577] [2023-11-23 08:53:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447989577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255857430] [2023-11-23 08:53:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:59,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:59,973 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 08:54:00,004 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 08:54:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:00,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 08:54:00,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-11-23 08:54:00,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:54:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255857430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:54:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:54:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-11-23 08:54:00,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717127941] [2023-11-23 08:54:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:54:00,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:54:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:54:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:54:00,525 INFO L87 Difference]: Start difference. First operand 256 states and 349 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:54:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:00,868 INFO L93 Difference]: Finished difference Result 479 states and 645 transitions. [2023-11-23 08:54:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:54:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2023-11-23 08:54:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:00,871 INFO L225 Difference]: With dead ends: 479 [2023-11-23 08:54:00,871 INFO L226 Difference]: Without dead ends: 253 [2023-11-23 08:54:00,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:54:00,874 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:00,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 829 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:54:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-23 08:54:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-11-23 08:54:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 163 states have (on average 1.2147239263803682) internal successors, (198), 171 states have internal predecessors, (198), 64 states have call successors, (64), 22 states have call predecessors, (64), 25 states have return successors, (81), 59 states have call predecessors, (81), 63 states have call successors, (81) [2023-11-23 08:54:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 343 transitions. [2023-11-23 08:54:00,919 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 343 transitions. Word has length 128 [2023-11-23 08:54:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:00,919 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 343 transitions. [2023-11-23 08:54:00,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-23 08:54:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2023-11-23 08:54:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-23 08:54:00,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:00,921 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:54:00,938 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 08:54:01,122 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,SelfDestructingSolverStorable10 [2023-11-23 08:54:01,122 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:01,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash -373297715, now seen corresponding path program 1 times [2023-11-23 08:54:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:01,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450610146] [2023-11-23 08:54:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:54:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:54:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:54:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 08:54:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-23 08:54:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450610146] [2023-11-23 08:54:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450610146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352631547] [2023-11-23 08:54:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:01,724 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 08:54:01,772 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 08:54:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:02,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-23 08:54:02,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2023-11-23 08:54:02,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-11-23 08:54:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352631547] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:02,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:54:02,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 13] total 20 [2023-11-23 08:54:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395160859] [2023-11-23 08:54:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:54:02,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:54:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:54:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:54:02,516 INFO L87 Difference]: Start difference. First operand 253 states and 343 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 08:54:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:02,735 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2023-11-23 08:54:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:54:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2023-11-23 08:54:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:02,739 INFO L225 Difference]: With dead ends: 267 [2023-11-23 08:54:02,740 INFO L226 Difference]: Without dead ends: 265 [2023-11-23 08:54:02,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:54:02,741 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 8 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:02,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 887 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:54:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-23 08:54:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 249. [2023-11-23 08:54:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 167 states have internal predecessors, (196), 64 states have call successors, (64), 22 states have call predecessors, (64), 23 states have return successors, (75), 59 states have call predecessors, (75), 63 states have call successors, (75) [2023-11-23 08:54:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 335 transitions. [2023-11-23 08:54:02,789 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 335 transitions. Word has length 138 [2023-11-23 08:54:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:02,789 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 335 transitions. [2023-11-23 08:54:02,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 08:54:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2023-11-23 08:54:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-23 08:54:02,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:02,800 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:54:02,823 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 08:54:03,017 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,SelfDestructingSolverStorable11 [2023-11-23 08:54:03,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:03,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1112161930, now seen corresponding path program 2 times [2023-11-23 08:54:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754076531] [2023-11-23 08:54:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 08:54:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:54:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:54:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 08:54:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-11-23 08:54:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754076531] [2023-11-23 08:54:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754076531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458482236] [2023-11-23 08:54:03,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:54:03,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:03,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:03,600 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 08:54:03,635 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 08:54:03,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:54:03,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:54:03,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 08:54:03,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:03,958 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2023-11-23 08:54:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2023-11-23 08:54:03,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:54:03,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:03,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-23 08:54:03,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:03,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2023-11-23 08:54:03,995 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 08:54:04,001 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse0))))) is different from true [2023-11-23 08:54:04,013 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) is different from true [2023-11-23 08:54:04,105 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (not (= .cse4 0)) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (store .cse5 .cse6 .cse4)) .cse4) .cse5))) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse4))))) is different from true [2023-11-23 08:54:04,146 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse5 .cse6 .cse4)) .cse4)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse7 0)) (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:04,244 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (not (= .cse4 0)) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (store .cse5 .cse6 .cse4)) .cse4) .cse5))) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse4)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (= .cse8 (select (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse8 .cse9 .cse7)) .cse7)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse10 0)) (= .cse10 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:04,281 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (not (= .cse4 0)) (or (= .cse4 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| (store .cse5 .cse6 .cse4)) .cse4) .cse5)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse7))) (= .cse8 (select (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse8 .cse9 .cse7)) .cse7)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse10 0)) (= .cse10 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:04,316 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (= (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse6 .cse7 .cse5)) .cse5) .cse6))) (not (= .cse5 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (= .cse9 (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse9 .cse10 .cse8)) .cse8)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse11 0)) (= .cse11 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:04,592 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (= (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse6 .cse7 .cse5)) .cse5) .cse6))) (not (= .cse5 0))))))) (not (= .cse8 0)) (or (= .cse8 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| (store .cse9 .cse10 .cse8)) .cse8) .cse9)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse13))) (and (not (= .cse11 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse11))) (= .cse12 (select (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse12 .cse13 .cse11)) .cse11)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse14 0)) (= .cse14 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:04,641 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (= (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse6 .cse7 .cse5)) .cse5) .cse6))) (not (= .cse5 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse8) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse11))) (and (not (= .cse9 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse10 .cse11 .cse9)) .cse9))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse13 .cse14 .cse12)) .cse12)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse15 0)) (= .cse15 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:04,787 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (= (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse6 .cse7 .cse5)) .cse5) .cse6))) (not (= .cse5 0))))))) (not (= .cse8 0)) (or (= .cse8 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| (store .cse9 .cse10 .cse8)) .cse8) .cse9)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse11) (not (= .cse11 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse13 .cse14 .cse12)) .cse12))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse17))) (and (not (= .cse15 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse15))) (= .cse16 (select (store (store |c_#memory_$Pointer$.base| .cse15 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse16 .cse17 .cse15)) .cse15)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse18 0)) (= .cse18 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:04,883 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse12) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse17 .cse18 .cse16)) .cse16)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:05,959 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse14))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (not (= .cse12 0)) (or (= .cse12 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| (store .cse13 .cse14 .cse12)) .cse12) .cse13)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse15) (not (= .cse15 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse17 .cse18 .cse16)) .cse16))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse21))) (and (not (= .cse19 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse19))) (= .cse20 (select (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse20 .cse21 .cse19)) .cse19)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse22 0)) (= .cse22 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:06,026 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse12) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse17 .cse18 .cse16)) .cse16)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:06,241 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse14))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (not (= .cse12 0)) (or (= .cse12 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| (store .cse13 .cse14 .cse12)) .cse12) .cse13)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse15) (not (= .cse15 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse17 .cse18 .cse16)) .cse16))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse21))) (and (not (= .cse19 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse19))) (= .cse20 (select (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse20 .cse21 .cse19)) .cse19)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse22 0)) (= .cse22 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse25))) (and (not (= .cse23 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse24 (select |c_#memory_$Pointer$.base| .cse23))) (= .cse24 (select (store (store |c_#memory_$Pointer$.base| .cse23 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse24 .cse25 .cse23)) .cse23)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse26 0)) (= .cse26 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:06,318 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_aws_linked_list_front_~list#1.offset| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_front_~list#1.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse9))) (= .cse8 (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| (store .cse8 .cse10 .cse9)) .cse9)))) (= |c_ULTIMATE.start_aws_linked_list_front_~list#1.base| .cse9)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse11 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse11 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse13 .cse14 .cse12)) .cse12) .cse13))) (not (= .cse12 0))))))) (not (= .cse9 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse15) (not (= .cse15 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse17 .cse18 .cse16)) .cse16))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse21 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse21))) (and (not (= .cse19 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse20 (select |c_#memory_$Pointer$.base| .cse19))) (= .cse20 (select (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse20 .cse21 .cse19)) .cse19)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse22 0)) (= .cse22 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse25))) (and (not (= .cse23 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse24 (select |c_#memory_$Pointer$.base| .cse23))) (= .cse24 (select (store (store |c_#memory_$Pointer$.base| .cse23 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse24 .cse25 .cse23)) .cse23)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse26 0)) (= .cse26 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))))) is different from true [2023-11-23 08:54:06,400 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse4 .cse6 .cse5)) .cse5)))) (not (= .cse5 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse7 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse10))) (= .cse9 (select (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse9 .cse11 .cse10)) .cse10)))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse15))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse14 .cse15 .cse13)) .cse13) .cse14))) (not (= .cse13 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse16) (not (= .cse16 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse19))) (and (not (= .cse17 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse17))) (= .cse18 (select (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse18 .cse19 .cse17)) .cse17))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse26 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse26))) (and (not (= .cse24 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse24))) (= .cse25 (select (store (store |c_#memory_$Pointer$.base| .cse24 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse25 .cse26 .cse24)) .cse24)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse27 0)) (= .cse27 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:07,199 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse4 .cse6 .cse5)) .cse5)))) (not (= .cse5 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse7 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse10))) (= .cse9 (select (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse9 .cse11 .cse10)) .cse10)))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse15))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse14 .cse15 .cse13)) .cse13) .cse14))) (not (= .cse13 0))))))) (or (= (select (select |c_#memory_$Pointer$.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_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse16) (not (= .cse16 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse19))) (and (not (= .cse17 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse17))) (= .cse18 (select (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse18 .cse19 .cse17)) .cse17))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse26 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse26))) (and (not (= .cse24 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse24))) (= .cse25 (select (store (store |c_#memory_$Pointer$.base| .cse24 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse25 .cse26 .cse24)) .cse24)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse27 0)) (= .cse27 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:07,267 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) .cse2))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_6| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse6))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse4 .cse6 .cse5)) .cse5)))) (not (= .cse5 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse7 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse8)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse10))) (= .cse9 (select (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse9 .cse11 .cse10)) .cse10)))) (not (= .cse10 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse15))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse14 .cse15 .cse13)) .cse13) .cse14))) (not (= .cse13 0))))))) (= (select (select |c_#memory_$Pointer$.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_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse16) (not (= .cse16 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse19))) (and (not (= .cse17 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse17))) (= .cse18 (select (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse18 .cse19 .cse17)) .cse17))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse26 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse26))) (and (not (= .cse24 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse24))) (= .cse25 (select (store (store |c_#memory_$Pointer$.base| .cse24 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse25 .cse26 .cse24)) .cse24)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse27 0)) (= .cse27 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 55 not checked. [2023-11-23 08:54:07,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:07,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:54:07,768 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 246 treesize of output 245 [2023-11-23 08:54:07,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2023-11-23 08:54:07,821 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 08:54:07,824 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 08:54:07,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-23 08:54:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-23 08:54:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458482236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:54:07,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:54:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24, 11] total 35 [2023-11-23 08:54:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960088836] [2023-11-23 08:54:07,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:54:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-23 08:54:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-23 08:54:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=243, Unknown=28, NotChecked=846, Total=1190 [2023-11-23 08:54:07,887 INFO L87 Difference]: Start difference. First operand 249 states and 335 transitions. Second operand has 35 states, 27 states have (on average 5.518518518518518) internal successors, (149), 28 states have internal predecessors, (149), 17 states have call successors, (42), 9 states have call predecessors, (42), 12 states have return successors, (41), 15 states have call predecessors, (41), 17 states have call successors, (41) [2023-11-23 08:54:08,254 WARN L876 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse5 .cse6 .cse4)) .cse4)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse7 0)) (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:08,259 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (= (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse2 .cse3 .cse1)) .cse1) .cse2))) (not (= .cse1 0))))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse5 .cse6 .cse4)) .cse4)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse7 0)) (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:16,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:16,296 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0))) (and (or .cse0 |c_aws_linked_list_is_valid_#t~short310#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse4 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse5)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse6 .cse8 .cse7)) .cse7)))) (not (= .cse7 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse9 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse9 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse12))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse10))) (= (select (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse11 .cse12 .cse10)) .cse10) .cse11))) (not (= .cse10 0))))))) (or .cse0 |c_aws_linked_list_is_valid_#t~short312#1|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse13) (not (= .cse13 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse16 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse16))) (and (not (= .cse14 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse15 (select |c_#memory_$Pointer$.base| .cse14))) (= .cse15 (select (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse15 .cse16 .cse14)) .cse14))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse19))) (and (not (= .cse17 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse17))) (= .cse18 (select (store (store |c_#memory_$Pointer$.base| .cse17 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse18 .cse19 .cse17)) .cse17)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse20 0)) (= .cse20 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|))))) (or .cse0 (not (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_~list#1.base|) (+ |c_aws_linked_list_is_valid_~list#1.offset| 24)) 0))))) is different from true [2023-11-23 08:54:16,958 WARN L876 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse12) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse17 .cse18 .cse16)) .cse16)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:16,972 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| (store .cse0 .cse2 .cse1)) .cse1)))) (not (= .cse1 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_26| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_36|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24)))) (and (not (= .cse4 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_24| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34|) .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_34| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_40| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (not (= .cse9 0))))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24)))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| .cse12) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_35| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| (store .cse17 .cse18 .cse16)) .cse16)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_27| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_37|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) .cse22))) (and (not (= .cse20 0)) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse20))) (= .cse21 (select (store (store |c_#memory_$Pointer$.base| .cse20 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| (store .cse21 .cse22 .cse20)) .cse20)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_29| 24)))) (and (not (= .cse23 0)) (= .cse23 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_41|)))))) is different from true [2023-11-23 08:54:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:19,393 INFO L93 Difference]: Finished difference Result 726 states and 964 transitions. [2023-11-23 08:54:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-23 08:54:19,399 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 5.518518518518518) internal successors, (149), 28 states have internal predecessors, (149), 17 states have call successors, (42), 9 states have call predecessors, (42), 12 states have return successors, (41), 15 states have call predecessors, (41), 17 states have call successors, (41) Word has length 141 [2023-11-23 08:54:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:19,404 INFO L225 Difference]: With dead ends: 726 [2023-11-23 08:54:19,404 INFO L226 Difference]: Without dead ends: 481 [2023-11-23 08:54:19,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=230, Invalid=1127, Unknown=67, NotChecked=2116, Total=3540 [2023-11-23 08:54:19,406 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 66 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 25 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 7448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 6389 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:19,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1955 Invalid, 7448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 999 Invalid, 35 Unknown, 6389 Unchecked, 6.2s Time] [2023-11-23 08:54:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-23 08:54:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 453. [2023-11-23 08:54:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 313 states have (on average 1.1853035143769968) internal successors, (371), 327 states have internal predecessors, (371), 90 states have call successors, (90), 44 states have call predecessors, (90), 49 states have return successors, (127), 81 states have call predecessors, (127), 89 states have call successors, (127) [2023-11-23 08:54:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 588 transitions. [2023-11-23 08:54:19,476 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 588 transitions. Word has length 141 [2023-11-23 08:54:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:19,477 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 588 transitions. [2023-11-23 08:54:19,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 5.518518518518518) internal successors, (149), 28 states have internal predecessors, (149), 17 states have call successors, (42), 9 states have call predecessors, (42), 12 states have return successors, (41), 15 states have call predecessors, (41), 17 states have call successors, (41) [2023-11-23 08:54:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 588 transitions. [2023-11-23 08:54:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 08:54:19,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:19,479 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:54:19,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 08:54:19,679 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,SelfDestructingSolverStorable12 [2023-11-23 08:54:19,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:19,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -520695145, now seen corresponding path program 1 times [2023-11-23 08:54:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071310980] [2023-11-23 08:54:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:54:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:54:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:54:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:54:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:19,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2023-11-23 08:54:20,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071310980] [2023-11-23 08:54:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071310980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581162335] [2023-11-23 08:54:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:20,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:20,036 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 08:54:20,088 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 08:54:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:20,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:54:20,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-23 08:54:20,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:54:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581162335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:54:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:54:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:54:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431258029] [2023-11-23 08:54:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:54:20,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:54:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:54:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:54:20,443 INFO L87 Difference]: Start difference. First operand 453 states and 588 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 08:54:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:20,666 INFO L93 Difference]: Finished difference Result 734 states and 1011 transitions. [2023-11-23 08:54:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:54:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2023-11-23 08:54:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:20,669 INFO L225 Difference]: With dead ends: 734 [2023-11-23 08:54:20,670 INFO L226 Difference]: Without dead ends: 461 [2023-11-23 08:54:20,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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 08:54:20,671 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:20,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 442 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:54:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-11-23 08:54:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 457. [2023-11-23 08:54:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 317 states have (on average 1.1766561514195584) internal successors, (373), 331 states have internal predecessors, (373), 90 states have call successors, (90), 44 states have call predecessors, (90), 49 states have return successors, (125), 81 states have call predecessors, (125), 89 states have call successors, (125) [2023-11-23 08:54:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 588 transitions. [2023-11-23 08:54:20,819 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 588 transitions. Word has length 153 [2023-11-23 08:54:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:20,821 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 588 transitions. [2023-11-23 08:54:20,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 08:54:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 588 transitions. [2023-11-23 08:54:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 08:54:20,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:20,824 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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] [2023-11-23 08:54:20,863 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 08:54:21,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:21,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:21,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -549195435, now seen corresponding path program 1 times [2023-11-23 08:54:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998283245] [2023-11-23 08:54:21,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:54:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:54:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:54:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:54:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-11-23 08:54:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:21,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998283245] [2023-11-23 08:54:21,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998283245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:21,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349480967] [2023-11-23 08:54:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:21,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:21,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:21,861 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 08:54:21,896 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 08:54:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:22,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 08:54:22,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-23 08:54:22,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-11-23 08:54:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349480967] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:54:22,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:54:22,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-11-23 08:54:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163893038] [2023-11-23 08:54:22,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:54:22,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:54:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:54:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:54:22,831 INFO L87 Difference]: Start difference. First operand 457 states and 588 transitions. Second operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 23 states have internal predecessors, (145), 11 states have call successors, (41), 2 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) [2023-11-23 08:54:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:23,636 INFO L93 Difference]: Finished difference Result 774 states and 1041 transitions. [2023-11-23 08:54:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:54:23,636 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 23 states have internal predecessors, (145), 11 states have call successors, (41), 2 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) Word has length 153 [2023-11-23 08:54:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:23,639 INFO L225 Difference]: With dead ends: 774 [2023-11-23 08:54:23,639 INFO L226 Difference]: Without dead ends: 523 [2023-11-23 08:54:23,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:54:23,641 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 210 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:23,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1669 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:54:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-23 08:54:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 480. [2023-11-23 08:54:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 333 states have (on average 1.1801801801801801) internal successors, (393), 352 states have internal predecessors, (393), 92 states have call successors, (92), 44 states have call predecessors, (92), 54 states have return successors, (140), 83 states have call predecessors, (140), 91 states have call successors, (140) [2023-11-23 08:54:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 625 transitions. [2023-11-23 08:54:23,802 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 625 transitions. Word has length 153 [2023-11-23 08:54:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:23,803 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 625 transitions. [2023-11-23 08:54:23,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 23 states have internal predecessors, (145), 11 states have call successors, (41), 2 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 11 states have call successors, (40) [2023-11-23 08:54:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 625 transitions. [2023-11-23 08:54:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 08:54:23,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:23,806 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:54:23,832 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 08:54:24,020 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,SelfDestructingSolverStorable14 [2023-11-23 08:54:24,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:24,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1043580709, now seen corresponding path program 1 times [2023-11-23 08:54:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339426451] [2023-11-23 08:54:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:54:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:54:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:54:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:54:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-11-23 08:54:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339426451] [2023-11-23 08:54:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339426451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369437096] [2023-11-23 08:54:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:24,468 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 08:54:24,520 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 08:54:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:24,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:54:24,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-11-23 08:54:24,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:54:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369437096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:54:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:54:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:54:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474046393] [2023-11-23 08:54:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:54:24,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:54:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:54:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:54:24,936 INFO L87 Difference]: Start difference. First operand 480 states and 625 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 08:54:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:25,124 INFO L93 Difference]: Finished difference Result 799 states and 1094 transitions. [2023-11-23 08:54:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:54:25,125 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2023-11-23 08:54:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:25,128 INFO L225 Difference]: With dead ends: 799 [2023-11-23 08:54:25,128 INFO L226 Difference]: Without dead ends: 493 [2023-11-23 08:54:25,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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 08:54:25,130 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 15 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:25,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:54:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-23 08:54:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 474. [2023-11-23 08:54:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 329 states have (on average 1.1671732522796352) internal successors, (384), 347 states have internal predecessors, (384), 91 states have call successors, (91), 44 states have call predecessors, (91), 53 states have return successors, (133), 82 states have call predecessors, (133), 90 states have call successors, (133) [2023-11-23 08:54:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 608 transitions. [2023-11-23 08:54:25,206 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 608 transitions. Word has length 153 [2023-11-23 08:54:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:25,206 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 608 transitions. [2023-11-23 08:54:25,206 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 08:54:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 608 transitions. [2023-11-23 08:54:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-23 08:54:25,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:54:25,209 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:25,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 08:54:25,421 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,SelfDestructingSolverStorable15 [2023-11-23 08:54:25,422 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:54:25,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:54:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1098279769, now seen corresponding path program 1 times [2023-11-23 08:54:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:54:25,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648536623] [2023-11-23 08:54:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:54:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:54:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:54:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:54:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:54:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:54:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:54:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 08:54:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-23 08:54:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:54:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:54:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:54:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-23 08:54:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 08:54:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:54:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2023-11-23 08:54:26,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:54:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648536623] [2023-11-23 08:54:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648536623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:54:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846944226] [2023-11-23 08:54:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:54:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:54:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:54:26,071 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 08:54:26,148 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 08:54:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:54:26,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 145 conjunts are in the unsatisfiable core [2023-11-23 08:54:26,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:54:26,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:54:26,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:26,636 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 11 treesize of output 7 [2023-11-23 08:54:26,642 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 08:54:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:26,645 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 08:54:26,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:26,680 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 18 treesize of output 18 [2023-11-23 08:54:26,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-23 08:54:26,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:26,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2023-11-23 08:54:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 105 proven. 87 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-23 08:54:33,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:35,632 INFO L349 Elim1Store]: treesize reduction 63, result has 62.0 percent of original size [2023-11-23 08:54:35,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 3634 treesize of output 3527 [2023-11-23 08:54:35,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:35,757 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 3493 treesize of output 2883 [2023-11-23 08:54:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-23 08:54:37,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:37,956 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 62 treesize of output 58 [2023-11-23 08:54:38,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:38,002 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 48 treesize of output 8 [2023-11-23 08:54:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:38,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:38,033 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 150 treesize of output 110 [2023-11-23 08:54:38,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:54:38,068 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 218 treesize of output 136 [2023-11-23 08:54:38,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:54:38,331 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 1 case distinctions, treesize of input 279 treesize of output 208 [2023-11-23 08:54:38,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:54:38,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 266 [2023-11-23 08:54:38,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:54:38,493 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 1261 treesize of output 1217 [2023-11-23 08:54:38,698 INFO L349 Elim1Store]: treesize reduction 120, result has 31.0 percent of original size [2023-11-23 08:54:38,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 716 treesize of output 766 [2023-11-23 08:54:38,976 INFO L349 Elim1Store]: treesize reduction 246, result has 13.7 percent of original size [2023-11-23 08:54:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 15 case distinctions, treesize of input 691 treesize of output 756 [2023-11-23 08:54:40,356 INFO L349 Elim1Store]: treesize reduction 787, result has 21.1 percent of original size [2023-11-23 08:54:40,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 54 case distinctions, treesize of input 1941 treesize of output 2168 [2023-11-23 08:54:53,328 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 08:54:56,467 INFO L349 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-11-23 08:54:56,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 17 case distinctions, treesize of input 110 treesize of output 158 [2023-11-23 08:55:02,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:02,638 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 4579 treesize of output 4529 [2023-11-23 08:55:08,416 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 08:55:08,463 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 08:55:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-23 08:55:08,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-23 08:55:08,970 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 08:55:12,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:12,338 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 4516 treesize of output 4476 [2023-11-23 08:56:07,315 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-11-23 08:56:07,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119254 treesize of output 118226 [2023-11-23 08:56:13,337 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 17768 DAG size of output: 7086 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-23 08:56:33,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:33,814 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:33,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:33,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:35,482 INFO L349 Elim1Store]: treesize reduction 773, result has 20.6 percent of original size [2023-11-23 08:56:35,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 52 case distinctions, treesize of input 24020 treesize of output 21936 Killed by 15