./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.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.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 edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:52:09,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:52:09,255 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:09,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:52:09,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:52:09,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:52:09,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:52:09,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:52:09,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:52:09,292 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:52:09,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:52:09,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:52:09,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:52:09,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:52:09,295 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:52:09,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:52:09,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:52:09,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:52:09,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:52:09,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:52:09,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:52:09,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:52:09,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:52:09,297 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:52:09,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:52:09,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:52:09,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:52:09,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:52:09,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:09,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:52:09,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:52:09,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:52:09,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:52:09,301 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 -> edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:52:09,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:52:09,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:52:09,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:52:09,534 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:52:09,534 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:52:09,535 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.i [2023-11-23 08:52:10,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:52:10,888 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:52:10,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_front_harness.i [2023-11-23 08:52:10,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd951bf41/9dca574d0b0846be87b27af119bd375c/FLAGe2f4a9ff3 [2023-11-23 08:52:10,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd951bf41/9dca574d0b0846be87b27af119bd375c [2023-11-23 08:52:10,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:52:10,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:52:10,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:10,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:52:10,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:52:10,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:10" (1/1) ... [2023-11-23 08:52:10,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b72cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:10, skipping insertion in model container [2023-11-23 08:52:10,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:10" (1/1) ... [2023-11-23 08:52:11,009 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:52:11,212 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.i[4499,4512] [2023-11-23 08:52:11,219 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.i[4559,4572] [2023-11-23 08:52:11,851 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,853 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,854 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,857 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,858 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,875 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,876 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,877 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,877 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,878 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,879 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,879 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:11,879 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,081 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:12,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:12,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:12,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:12,083 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:12,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:12,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:12,084 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:12,085 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:12,085 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:12,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:12,246 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:52:12,257 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.i[4499,4512] [2023-11-23 08:52:12,258 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.i[4559,4572] [2023-11-23 08:52:12,312 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,312 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,312 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,313 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,313 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,320 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,320 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,321 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,321 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,321 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,322 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,322 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,322 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:12,340 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:12,341 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:12,341 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:12,342 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:12,342 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:12,342 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:12,343 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:12,343 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:12,343 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:12,344 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:12,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:12,543 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,544 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:12,550 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:52:12,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:12 WrapperNode [2023-11-23 08:52:12,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:12,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:12,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:52:12,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:52:12,556 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:12" (1/1) ... [2023-11-23 08:52:12,623 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:12" (1/1) ... [2023-11-23 08:52:12,669 INFO L138 Inliner]: procedures = 678, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2023-11-23 08:52:12,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:12,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:52:12,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:52:12,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:52:12,678 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:12" (1/1) ... [2023-11-23 08:52:12,678 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:12" (1/1) ... [2023-11-23 08:52:12,697 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:12" (1/1) ... [2023-11-23 08:52:12,698 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:12" (1/1) ... [2023-11-23 08:52:12,726 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:12" (1/1) ... [2023-11-23 08:52:12,729 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:12" (1/1) ... [2023-11-23 08:52:12,731 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:12" (1/1) ... [2023-11-23 08:52:12,745 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:12" (1/1) ... [2023-11-23 08:52:12,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:52:12,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:52:12,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:52:12,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:52:12,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:12" (1/1) ... [2023-11-23 08:52:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:12,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:12,789 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:12,802 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:12,829 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-23 08:52:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-23 08:52:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-23 08:52:12,830 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-23 08:52:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:52:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:52:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:52:12,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:52:12,830 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:12,831 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:52:12,831 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:52:12,831 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:52:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:52:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:52:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:52:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:52:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 08:52:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 08:52:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-23 08:52:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-23 08:52:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:52:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:52:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:52:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:52:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:52:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:52:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:52:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:52:13,069 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:52:13,070 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:52:13,307 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:52:13,331 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:52:13,331 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-23 08:52:13,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:13 BoogieIcfgContainer [2023-11-23 08:52:13,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:52:13,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:52:13,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:52:13,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:52:13,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:10" (1/3) ... [2023-11-23 08:52:13,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3dd605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:13, skipping insertion in model container [2023-11-23 08:52:13,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:12" (2/3) ... [2023-11-23 08:52:13,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3dd605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:13, skipping insertion in model container [2023-11-23 08:52:13,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:13" (3/3) ... [2023-11-23 08:52:13,337 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2023-11-23 08:52:13,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:52:13,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:52:13,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:52:13,424 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;@21743980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:52:13,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:52:13,428 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:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:13,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:13,440 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:13,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:13,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1865494359, now seen corresponding path program 1 times [2023-11-23 08:52:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116650613] [2023-11-23 08:52:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,112 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:14,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:14,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116650613] [2023-11-23 08:52:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116650613] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762097787] [2023-11-23 08:52:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:14,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:14,129 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:14,165 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:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:52:14,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:14,418 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:14,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762097787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:52:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046936003] [2023-11-23 08:52:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:14,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:14,466 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:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:14,569 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2023-11-23 08:52:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:14,571 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:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:14,578 INFO L225 Difference]: With dead ends: 244 [2023-11-23 08:52:14,578 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 08:52:14,582 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:14,584 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.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:14,584 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.0s Time] [2023-11-23 08:52:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 08:52:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2023-11-23 08:52:14,614 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:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2023-11-23 08:52:14,617 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 110 [2023-11-23 08:52:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:14,618 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2023-11-23 08:52:14,618 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:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2023-11-23 08:52:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:14,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:14,622 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:14,638 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:14,834 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:14,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:14,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1194339989, now seen corresponding path program 1 times [2023-11-23 08:52:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927059920] [2023-11-23 08:52:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,075 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:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:15,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927059920] [2023-11-23 08:52:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927059920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922785823] [2023-11-23 08:52:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:15,077 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:15,103 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:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:15,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:52:15,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:15,227 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:15,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922785823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:52:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374540936] [2023-11-23 08:52:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:15,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:15,230 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:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:15,285 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2023-11-23 08:52:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:15,285 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:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:15,288 INFO L225 Difference]: With dead ends: 230 [2023-11-23 08:52:15,288 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:52:15,289 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:15,290 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:15,291 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:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:52:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-11-23 08:52:15,302 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:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2023-11-23 08:52:15,304 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 110 [2023-11-23 08:52:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:15,304 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2023-11-23 08:52:15,305 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:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2023-11-23 08:52:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:15,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:15,306 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:15,319 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:15,518 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:15,519 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:15,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1019340115, now seen corresponding path program 1 times [2023-11-23 08:52:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639725877] [2023-11-23 08:52:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,585 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:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639725877] [2023-11-23 08:52:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639725877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911310694] [2023-11-23 08:52:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:16,594 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:16,596 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:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:16,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 08:52:16,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:16,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 08:52:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-23 08:52:17,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911310694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 19 [2023-11-23 08:52:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957099555] [2023-11-23 08:52:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 08:52:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 08:52:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:52:17,542 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 08:52:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:18,197 INFO L93 Difference]: Finished difference Result 332 states and 454 transitions. [2023-11-23 08:52:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:52:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2023-11-23 08:52:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:18,200 INFO L225 Difference]: With dead ends: 332 [2023-11-23 08:52:18,200 INFO L226 Difference]: Without dead ends: 217 [2023-11-23 08:52:18,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 20 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2023-11-23 08:52:18,202 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 97 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:18,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 923 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:52:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-23 08:52:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2023-11-23 08:52:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2790697674418605) internal successors, (165), 131 states have internal predecessors, (165), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-23 08:52:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 284 transitions. [2023-11-23 08:52:18,218 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 284 transitions. Word has length 110 [2023-11-23 08:52:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:18,218 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 284 transitions. [2023-11-23 08:52:18,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 08:52:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 284 transitions. [2023-11-23 08:52:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:18,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:18,221 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,246 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:18,434 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:18,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:18,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1695217767, now seen corresponding path program 1 times [2023-11-23 08:52:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935993215] [2023-11-23 08:52:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 08:52:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935993215] [2023-11-23 08:52:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935993215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379528439] [2023-11-23 08:52:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:18,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:18,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:18,678 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:18,680 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:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:18,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-23 08:52:18,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:18,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 08:52:18,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:52:18,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:18,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2023-11-23 08:52:18,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-23 08:52:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-23 08:52:20,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379528439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 08:52:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781460613] [2023-11-23 08:52:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:52:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:52:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:52:20,711 INFO L87 Difference]: Start difference. First operand 206 states and 284 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 08:52:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:21,419 INFO L93 Difference]: Finished difference Result 358 states and 485 transitions. [2023-11-23 08:52:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:52:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 110 [2023-11-23 08:52:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:21,423 INFO L225 Difference]: With dead ends: 358 [2023-11-23 08:52:21,424 INFO L226 Difference]: Without dead ends: 209 [2023-11-23 08:52:21,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:52:21,431 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 84 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:21,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 693 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:52:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-23 08:52:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2023-11-23 08:52:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 131 states have internal predecessors, (164), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-23 08:52:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2023-11-23 08:52:21,478 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 110 [2023-11-23 08:52:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:21,479 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2023-11-23 08:52:21,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-23 08:52:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2023-11-23 08:52:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:52:21,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:21,484 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:21,504 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:52:21,701 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:52:21,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:21,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1870217641, now seen corresponding path program 1 times [2023-11-23 08:52:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822842496] [2023-11-23 08:52:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:52:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:52:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:52:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:52:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:52:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:52:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:52:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:52:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:52:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:52:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 08:52:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822842496] [2023-11-23 08:52:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822842496] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19162360] [2023-11-23 08:52:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:21,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:21,929 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:52:21,951 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:52:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:22,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:52:22,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:22,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2023-11-23 08:52:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:22,129 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:52:22,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-11-23 08:52:22,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:52:24,183 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse2 .cse0))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) is different from true [2023-11-23 08:52:24,333 WARN L876 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select .cse1 .cse2))) (or (and (<= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2 .cse0)))) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse0)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-23 08:52:24,398 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_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse2 .cse0))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-23 08:52:26,772 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse2 .cse0))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse5 .cse3))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8 .cse6))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-23 08:52:27,233 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse0 (select .cse1 .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse2 .cse0))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse4 .cse3) .cse5)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse8 .cse6))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse9 (select .cse10 .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse10 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse11 .cse9))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-23 08:52:29,990 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24))) (let ((.cse1 (select .cse0 .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) .cse2 .cse1))) (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24))) (let ((.cse3 (select .cse4 .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse4 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) .cse5 .cse3))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_9| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_9|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|) .cse7 .cse6) .cse8)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (.cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24))) (let ((.cse9 (select .cse10 .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse10 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) .cse11 .cse9))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_12| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_12|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse13 .cse14))) (and (<= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse13 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse14 .cse12))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-23 08:52:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 28 not checked. [2023-11-23 08:52:31,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:31,819 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:52:31,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 176 [2023-11-23 08:52:31,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:31,830 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 65 treesize of output 67 [2023-11-23 08:52:31,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-23 08:52:31,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 08:52:31,865 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 50 treesize of output 42 [2023-11-23 08:52:32,005 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:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19162360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:52:32,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:52:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 10] total 31 [2023-11-23 08:52:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961443101] [2023-11-23 08:52:32,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:52:32,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:52:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:52:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=525, Unknown=15, NotChecked=306, Total=930 [2023-11-23 08:52:32,008 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 31 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) [2023-11-23 08:53:04,924 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:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:06,262 INFO L93 Difference]: Finished difference Result 452 states and 608 transitions. [2023-11-23 08:53:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-23 08:53:06,263 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) Word has length 110 [2023-11-23 08:53:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:06,264 INFO L225 Difference]: With dead ends: 452 [2023-11-23 08:53:06,264 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 08:53:06,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=241, Invalid=1719, Unknown=44, NotChecked=546, Total=2550 [2023-11-23 08:53:06,266 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 95 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 1 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 2051 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:06,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1641 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 986 Invalid, 29 Unknown, 2051 Unchecked, 5.0s Time] [2023-11-23 08:53:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 08:53:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2023-11-23 08:53:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 165 states have internal predecessors, (202), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (66), 60 states have call predecessors, (66), 62 states have call successors, (66) [2023-11-23 08:53:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 331 transitions. [2023-11-23 08:53:06,290 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 331 transitions. Word has length 110 [2023-11-23 08:53:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:06,290 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 331 transitions. [2023-11-23 08:53:06,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 14 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 13 states have call predecessors, (38), 14 states have call successors, (38) [2023-11-23 08:53:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 331 transitions. [2023-11-23 08:53:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 08:53:06,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:06,292 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:06,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:06,492 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:06,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:06,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 722758912, now seen corresponding path program 1 times [2023-11-23 08:53:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:06,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329644126] [2023-11-23 08:53:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:53:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:53:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:53:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:53:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 08:53:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:53:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,724 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:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329644126] [2023-11-23 08:53:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329644126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45790430] [2023-11-23 08:53:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:06,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:06,741 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:06,742 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:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:06,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:53:06,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:07,018 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:07,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45790430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:07,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:07,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 08:53:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650856999] [2023-11-23 08:53:07,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:07,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:53:07,021 INFO L87 Difference]: Start difference. First operand 250 states and 331 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:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:07,179 INFO L93 Difference]: Finished difference Result 442 states and 595 transitions. [2023-11-23 08:53:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:07,179 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:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:07,181 INFO L225 Difference]: With dead ends: 442 [2023-11-23 08:53:07,181 INFO L226 Difference]: Without dead ends: 256 [2023-11-23 08:53:07,182 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:07,182 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 710 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:07,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 710 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:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-23 08:53:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2023-11-23 08:53:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 168 states have internal predecessors, (203), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 08:53:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 334 transitions. [2023-11-23 08:53:07,204 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 334 transitions. Word has length 113 [2023-11-23 08:53:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:07,205 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 334 transitions. [2023-11-23 08:53:07,205 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:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2023-11-23 08:53:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 08:53:07,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:07,206 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2023-11-23 08:53:07,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 08:53:07,412 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:07,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:07,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1106362701, now seen corresponding path program 1 times [2023-11-23 08:53:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:07,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268595980] [2023-11-23 08:53:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:53:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:53:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:53:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 08:53:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:53:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:53:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,646 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:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268595980] [2023-11-23 08:53:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268595980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686157245] [2023-11-23 08:53:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:07,661 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:07,662 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:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:07,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 08:53:07,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:07,896 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:07,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:07,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686157245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:07,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:07,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2023-11-23 08:53:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700613578] [2023-11-23 08:53:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:07,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:53:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:53:07,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:53:07,898 INFO L87 Difference]: Start difference. First operand 253 states and 334 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:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:08,114 INFO L93 Difference]: Finished difference Result 470 states and 636 transitions. [2023-11-23 08:53:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:53:08,115 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:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:08,117 INFO L225 Difference]: With dead ends: 470 [2023-11-23 08:53:08,117 INFO L226 Difference]: Without dead ends: 280 [2023-11-23 08:53:08,118 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:08,118 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:08,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 823 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-23 08:53:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2023-11-23 08:53:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.2395209580838322) internal successors, (207), 171 states have internal predecessors, (207), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 08:53:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2023-11-23 08:53:08,141 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 115 [2023-11-23 08:53:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:08,141 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2023-11-23 08:53:08,142 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:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2023-11-23 08:53:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 08:53:08,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:08,143 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2023-11-23 08:53:08,165 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:08,357 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:08,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:08,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1211433675, now seen corresponding path program 1 times [2023-11-23 08:53:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487995372] [2023-11-23 08:53:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:53:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:53:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:53:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:53:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:53:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-23 08:53:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,612 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:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487995372] [2023-11-23 08:53:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487995372] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323567191] [2023-11-23 08:53:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:08,636 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:08,638 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:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:08,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:53:08,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:08,814 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:08,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323567191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-23 08:53:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221945431] [2023-11-23 08:53:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:08,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:53:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:53:08,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:08,818 INFO L87 Difference]: Start difference. First operand 256 states and 338 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:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:08,868 INFO L93 Difference]: Finished difference Result 463 states and 631 transitions. [2023-11-23 08:53:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:53:08,869 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:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:08,871 INFO L225 Difference]: With dead ends: 463 [2023-11-23 08:53:08,871 INFO L226 Difference]: Without dead ends: 271 [2023-11-23 08:53:08,872 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:08,873 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:08,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 293 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-23 08:53:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 260. [2023-11-23 08:53:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 171 states have (on average 1.239766081871345) internal successors, (212), 175 states have internal predecessors, (212), 63 states have call successors, (63), 24 states have call predecessors, (63), 25 states have return successors, (68), 60 states have call predecessors, (68), 62 states have call successors, (68) [2023-11-23 08:53:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2023-11-23 08:53:08,900 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 343 transitions. Word has length 116 [2023-11-23 08:53:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 343 transitions. [2023-11-23 08:53:08,902 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:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2023-11-23 08:53:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 08:53:08,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:08,903 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1] [2023-11-23 08:53:08,919 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:09,117 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:09,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:09,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1989125873, now seen corresponding path program 1 times [2023-11-23 08:53:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897821516] [2023-11-23 08:53:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:53:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:53:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:53:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:53:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:53:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:53:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:53:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:53:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:53:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-23 08:53:09,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:09,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897821516] [2023-11-23 08:53:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897821516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:09,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631734596] [2023-11-23 08:53:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:09,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:09,849 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:09,874 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:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-23 08:53:10,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:10,038 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:10,187 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:53:10,197 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:53:10,197 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:53:10,200 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:53:10,211 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:53:10,211 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:53:10,256 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-11-23 08:53:10,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 28 [2023-11-23 08:53:12,298 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_27|)) (= (select .cse1 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19|) .cse0))))) is different from true [2023-11-23 08:53:14,391 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)))) (and (not (= .cse0 0)) (= .cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20|)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_28|)))))) is different from true [2023-11-23 08:53:16,488 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (let ((.cse1 (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15| 24)))) (and (= (select .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_15|) .cse1) (not (= 0 .cse1)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| .cse1)))))) is different from true [2023-11-23 08:53:18,621 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16| 24)))) (and (not (= .cse0 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| .cse0)) (= (select .cse1 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_16|) .cse0))))) is different from true [2023-11-23 08:53:20,691 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_23|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24)))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_23| .cse0)) (not (= .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17|) .cse0))))) is different from true [2023-11-23 08:53:22,844 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18|)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_24|)) (not (= .cse0 0)))))) is different from true [2023-11-23 08:53:24,936 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|))) (let ((.cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_11| 24)))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_11|)) (not (= .cse0 0)) (= .cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_front_~list#1.offset_BEFORE_CALL_11|)))))) is different from true [2023-11-23 08:53:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 75 not checked. [2023-11-23 08:53:37,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:47,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:47,685 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 46 treesize of output 39 [2023-11-23 08:53:47,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:47,704 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 448 treesize of output 400 [2023-11-23 08:53:47,710 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 420 treesize of output 408 [2023-11-23 08:53:47,850 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:53:47,860 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 26 treesize of output 24 [2023-11-23 08:53:47,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:53:47,869 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 92 treesize of output 86 [2023-11-23 08:53:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631734596] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:48,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2023-11-23 08:53:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293741831] [2023-11-23 08:53:48,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:48,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 08:53:48,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:48,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 08:53:48,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1150, Unknown=18, NotChecked=518, Total=1806 [2023-11-23 08:53:48,206 INFO L87 Difference]: Start difference. First operand 260 states and 343 transitions. Second operand has 33 states, 31 states have (on average 4.387096774193548) internal successors, (136), 31 states have internal predecessors, (136), 12 states have call successors, (33), 10 states have call predecessors, (33), 13 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2023-11-23 08:54:06,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:12,745 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:54:14,760 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:54:22,811 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:54:24,819 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:54:26,828 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:54:28,840 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:54:38,919 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:54:40,925 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:54:42,936 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:54:44,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:46,973 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:54:48,977 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:54:50,982 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:54:53,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:55,012 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:54:57,033 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:54:59,038 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:55:01,043 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:55:03,053 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:55:05,059 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:55:07,070 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:55:09,082 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:55:11,095 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:55:17,142 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:55:19,161 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:55:25,221 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:55:27,239 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:55:37,464 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:55:43,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:45,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:47,548 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:55:53,592 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:55:55,594 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:55:57,604 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:56:03,658 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:56:05,664 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:56:07,669 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:56:09,673 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:56:11,681 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:56:13,689 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:56:15,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:17,738 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:56:19,751 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:56:21,756 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:56:23,767 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:56:25,775 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:56:27,782 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:56:31,875 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:56:33,881 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:56:40,011 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:56:42,023 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:56:44,034 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] Killed by 15