./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:59:47,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:59:47,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:59:47,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:59:47,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:59:47,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:59:47,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:59:47,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:59:47,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:59:47,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:59:47,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:59:47,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:59:47,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:59:47,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:59:47,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:59:47,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:59:47,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:59:47,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:59:47,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:59:47,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:59:47,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:59:47,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:59:47,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:59:47,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:59:47,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:59:47,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:59:47,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:59:47,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:59:47,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:59:47,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:59:47,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:59:47,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:59:47,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:59:47,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:59:47,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:59:47,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:59:47,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:59:47,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:59:47,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:59:47,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:59:47,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:59:47,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 11:59:47,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:59:47,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:59:47,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:59:47,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:59:47,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:59:47,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:59:47,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:59:47,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:59:47,772 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:59:47,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:59:47,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:59:47,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:59:47,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:59:47,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:59:47,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:59:47,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:59:47,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:59:47,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:59:47,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:59:47,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:59:47,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:59:47,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:59:47,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:59:47,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:59:47,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:59:47,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:59:47,775 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:59:47,775 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-12-13 11:59:48,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:59:48,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:59:48,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:59:48,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:59:48,033 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:59:48,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-12-13 11:59:50,653 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:59:50,915 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:59:50,916 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-12-13 11:59:50,931 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/data/34ae476d3/a4490779380041aaa3fea472f305d71d/FLAG02ae29e92 [2022-12-13 11:59:50,941 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/data/34ae476d3/a4490779380041aaa3fea472f305d71d [2022-12-13 11:59:50,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:59:50,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:59:50,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:59:50,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:59:50,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:59:50,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:59:50" (1/1) ... [2022-12-13 11:59:50,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ae86f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:50, skipping insertion in model container [2022-12-13 11:59:50,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:59:50" (1/1) ... [2022-12-13 11:59:50,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:59:51,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:59:51,165 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-12-13 11:59:51,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-12-13 11:59:51,752 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,752 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,753 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,754 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,755 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,764 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,764 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,766 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,766 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,768 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,768 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,769 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,769 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:51,845 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:51,846 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:51,847 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:51,850 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 11:59:51,852 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 11:59:51,852 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 11:59:52,108 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 11:59:52,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 11:59:52,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 11:59:52,112 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 11:59:52,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 11:59:52,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 11:59:52,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 11:59:52,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 11:59:52,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 11:59:52,116 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 11:59:52,116 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 11:59:52,224 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 11:59:52,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:59:52,253 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:59:52,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-12-13 11:59:52,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-12-13 11:59:52,292 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,294 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,300 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,300 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,301 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,301 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,302 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,303 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,303 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,304 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:59:52,309 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:52,309 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:52,310 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:59:52,312 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 11:59:52,313 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 11:59:52,314 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 11:59:52,370 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 11:59:52,371 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 11:59:52,371 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 11:59:52,372 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 11:59:52,373 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 11:59:52,373 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 11:59:52,374 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 11:59:52,374 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 11:59:52,374 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 11:59:52,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 11:59:52,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 11:59:52,391 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 11:59:52,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:59:52,526 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:59:52,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52 WrapperNode [2022-12-13 11:59:52,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:59:52,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:59:52,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:59:52,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:59:52,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,590 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-12-13 11:59:52,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:59:52,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:59:52,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:59:52,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:59:52,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,609 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:59:52,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:59:52,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:59:52,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:59:52,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (1/1) ... [2022-12-13 11:59:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:59:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:59:52,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:59:52,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:59:52,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:59:52,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 11:59:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 11:59:52,674 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-12-13 11:59:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-12-13 11:59:52,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:59:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 11:59:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 11:59:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-12-13 11:59:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-12-13 11:59:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:59:52,859 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:59:52,861 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:59:53,005 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:59:53,011 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:59:53,012 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:59:53,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:59:53 BoogieIcfgContainer [2022-12-13 11:59:53,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:59:53,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:59:53,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:59:53,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:59:53,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:59:50" (1/3) ... [2022-12-13 11:59:53,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584eeff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:59:53, skipping insertion in model container [2022-12-13 11:59:53,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:52" (2/3) ... [2022-12-13 11:59:53,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584eeff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:59:53, skipping insertion in model container [2022-12-13 11:59:53,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:59:53" (3/3) ... [2022-12-13 11:59:53,021 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-12-13 11:59:53,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:59:53,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:59:53,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:59:53,093 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=LoopsAndPotentialCycles, 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;@58151f9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:59:53,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 11:59:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 11:59:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:59:53,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:59:53,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:53,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:59:53,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2022-12-13 11:59:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:53,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111033059] [2022-12-13 11:59:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:59:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:59:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:59:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 11:59:53,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:53,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111033059] [2022-12-13 11:59:53,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111033059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:53,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:53,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:59:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117310475] [2022-12-13 11:59:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:53,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:59:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:59:53,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:59:53,465 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 11:59:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:59:53,490 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-12-13 11:59:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:59:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-12-13 11:59:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:59:53,498 INFO L225 Difference]: With dead ends: 94 [2022-12-13 11:59:53,498 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 11:59:53,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:59:53,503 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:59:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:59:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 11:59:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-12-13 11:59:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 11:59:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-12-13 11:59:53,542 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-12-13 11:59:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:59:53,543 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-12-13 11:59:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 11:59:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-12-13 11:59:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:59:53,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:59:53,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:59:53,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:59:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2022-12-13 11:59:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:53,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254360073] [2022-12-13 11:59:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:59:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:59:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:54,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:59:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:59:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:54,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254360073] [2022-12-13 11:59:54,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254360073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:59:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652067435] [2022-12-13 11:59:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:59:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:59:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:59:54,818 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:59:55,078 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-12-13 11:59:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:59:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-12-13 11:59:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:59:55,080 INFO L225 Difference]: With dead ends: 56 [2022-12-13 11:59:55,080 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 11:59:55,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:59:55,081 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:59:55,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 279 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:59:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 11:59:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-12-13 11:59:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 11:59:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-12-13 11:59:55,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2022-12-13 11:59:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:59:55,089 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-12-13 11:59:55,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-12-13 11:59:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:59:55,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:59:55,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:55,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:59:55,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:59:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2022-12-13 11:59:55,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954436724] [2022-12-13 11:59:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:59:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:59:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:59:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:59:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954436724] [2022-12-13 11:59:55,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954436724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:55,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:55,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:59:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354845856] [2022-12-13 11:59:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:55,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:59:55,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:59:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:59:55,478 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:59:55,645 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2022-12-13 11:59:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:59:55,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-12-13 11:59:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:59:55,647 INFO L225 Difference]: With dead ends: 109 [2022-12-13 11:59:55,647 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 11:59:55,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:59:55,649 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:59:55,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:59:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 11:59:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-12-13 11:59:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-12-13 11:59:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-12-13 11:59:55,660 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2022-12-13 11:59:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:59:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-12-13 11:59:55,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-12-13 11:59:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:59:55,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:59:55,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:55,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:59:55,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:59:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2022-12-13 11:59:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:55,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619320497] [2022-12-13 11:59:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:59:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:59:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:59:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:59:55,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619320497] [2022-12-13 11:59:55,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619320497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:59:55,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:59:55,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:59:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435444983] [2022-12-13 11:59:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:59:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:59:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:59:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:59:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:59:55,815 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:59:55,844 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-12-13 11:59:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:59:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-12-13 11:59:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:59:55,845 INFO L225 Difference]: With dead ends: 115 [2022-12-13 11:59:55,846 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 11:59:55,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:59:55,847 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:59:55,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:59:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 11:59:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-12-13 11:59:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-12-13 11:59:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-12-13 11:59:55,859 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2022-12-13 11:59:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:59:55,859 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-12-13 11:59:55,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 11:59:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-12-13 11:59:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 11:59:55,861 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:59:55,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:59:55,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:59:55,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:59:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:59:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2022-12-13 11:59:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:59:55,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813708086] [2022-12-13 11:59:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:59:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:59:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:59:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:59:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 11:59:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 11:59:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:59:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:59:56,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813708086] [2022-12-13 11:59:56,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813708086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:59:56,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498472102] [2022-12-13 11:59:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:59:56,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:59:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:59:56,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:59:56,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:59:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:59:57,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-13 11:59:57,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:59:57,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:59:57,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:59:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 11:59:57,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:59:57,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 11:59:57,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:59:57,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-12-13 11:59:57,090 INFO L350 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 7 [2022-12-13 11:59:57,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 11:59:57,102 INFO L350 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 18 treesize of output 12 [2022-12-13 11:59:58,787 INFO L321 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-12-13 11:59:58,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 221 treesize of output 133 [2022-12-13 11:59:58,817 INFO L321 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-12-13 11:59:58,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 43 [2022-12-13 11:59:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:59:58,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:00:11,552 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:00:23,700 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:00:25,947 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod |c_aws_linked_list_node_prev_is_valid_#res| 256) 0) (let ((.cse2 (+ 8 |c_aws_linked_list_node_prev_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2))) (and (= |c_aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |c_aws_linked_list_node_prev_is_valid_#in~node.offset|)))) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)))))) is different from false [2022-12-13 12:00:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:00:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498472102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:00:26,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:00:26,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 45 [2022-12-13 12:00:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850585060] [2022-12-13 12:00:26,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:00:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 12:00:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 12:00:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1731, Unknown=2, NotChecked=84, Total=1980 [2022-12-13 12:00:26,133 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 12:00:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:45,235 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-12-13 12:00:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 12:00:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 42 [2022-12-13 12:00:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:45,236 INFO L225 Difference]: With dead ends: 72 [2022-12-13 12:00:45,236 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 12:00:45,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=308, Invalid=3115, Unknown=3, NotChecked=114, Total=3540 [2022-12-13 12:00:45,238 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 83 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:45,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 493 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 960 Invalid, 0 Unknown, 61 Unchecked, 1.1s Time] [2022-12-13 12:00:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 12:00:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-12-13 12:00:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 12:00:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-12-13 12:00:45,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 42 [2022-12-13 12:00:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:45,246 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-12-13 12:00:45,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 12:00:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-12-13 12:00:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 12:00:45,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:45,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:45,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:00:45,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:00:45,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2022-12-13 12:00:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:45,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653272793] [2022-12-13 12:00:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:00:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:45,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653272793] [2022-12-13 12:00:45,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653272793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:45,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:45,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:00:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722189771] [2022-12-13 12:00:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:00:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:00:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:00:45,919 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:00:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:46,104 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2022-12-13 12:00:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:00:46,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-12-13 12:00:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:46,105 INFO L225 Difference]: With dead ends: 110 [2022-12-13 12:00:46,105 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 12:00:46,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:00:46,106 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:46,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 187 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:00:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 12:00:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-12-13 12:00:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-12-13 12:00:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-12-13 12:00:46,113 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 42 [2022-12-13 12:00:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:46,113 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-12-13 12:00:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:00:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-12-13 12:00:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 12:00:46,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:46,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:46,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:00:46,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2022-12-13 12:00:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472121583] [2022-12-13 12:00:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:00:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472121583] [2022-12-13 12:00:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472121583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:46,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:00:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201924562] [2022-12-13 12:00:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:00:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:00:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:00:46,385 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:00:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:46,478 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2022-12-13 12:00:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:00:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-12-13 12:00:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:46,479 INFO L225 Difference]: With dead ends: 121 [2022-12-13 12:00:46,479 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 12:00:46,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:00:46,480 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:46,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 205 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:00:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 12:00:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-12-13 12:00:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-13 12:00:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-12-13 12:00:46,487 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 42 [2022-12-13 12:00:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:46,487 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-12-13 12:00:46,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:00:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-12-13 12:00:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:00:46,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:46,488 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:46,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:00:46,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2022-12-13 12:00:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:46,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079075017] [2022-12-13 12:00:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:46,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:00:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 12:00:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079075017] [2022-12-13 12:00:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079075017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:46,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:46,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:00:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18088582] [2022-12-13 12:00:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:46,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:00:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:00:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:00:46,664 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 12:00:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:46,777 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-12-13 12:00:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:00:46,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-12-13 12:00:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:46,778 INFO L225 Difference]: With dead ends: 71 [2022-12-13 12:00:46,778 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 12:00:46,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:00:46,779 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:46,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 210 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:00:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 12:00:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 12:00:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-13 12:00:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-12-13 12:00:46,785 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 48 [2022-12-13 12:00:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:46,786 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-12-13 12:00:46,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 12:00:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-12-13 12:00:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:00:46,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:46,787 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-13 12:00:46,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:00:46,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2022-12-13 12:00:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:46,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569331276] [2022-12-13 12:00:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:00:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:00:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:00:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 12:00:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:47,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569331276] [2022-12-13 12:00:47,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569331276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:47,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:47,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:00:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3608797] [2022-12-13 12:00:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:47,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:00:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:00:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:00:47,509 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:00:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:47,785 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-12-13 12:00:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:00:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-12-13 12:00:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:47,786 INFO L225 Difference]: With dead ends: 80 [2022-12-13 12:00:47,786 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 12:00:47,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:00:47,787 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:47,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:00:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 12:00:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-12-13 12:00:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 12:00:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-12-13 12:00:47,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 63 [2022-12-13 12:00:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:47,797 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-12-13 12:00:47,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:00:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-12-13 12:00:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:00:47,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:47,799 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:47,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:00:47,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2022-12-13 12:00:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846493392] [2022-12-13 12:00:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:00:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:00:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:00:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 12:00:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:48,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846493392] [2022-12-13 12:00:48,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846493392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:48,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:48,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:00:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519320324] [2022-12-13 12:00:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:48,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:00:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:00:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:00:48,451 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-13 12:00:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:48,671 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-12-13 12:00:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:00:48,671 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 63 [2022-12-13 12:00:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:48,672 INFO L225 Difference]: With dead ends: 111 [2022-12-13 12:00:48,672 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 12:00:48,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 12:00:48,673 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 46 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:48,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 287 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:00:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 12:00:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-12-13 12:00:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 12:00:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-12-13 12:00:48,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 63 [2022-12-13 12:00:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:48,681 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-12-13 12:00:48,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-13 12:00:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-12-13 12:00:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:00:48,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:48,683 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:48,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:00:48,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2022-12-13 12:00:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:48,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269481247] [2022-12-13 12:00:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:00:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:00:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:00:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 12:00:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:48,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269481247] [2022-12-13 12:00:48,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269481247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:48,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:48,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:00:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746009536] [2022-12-13 12:00:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:00:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:00:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:00:48,789 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 12:00:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:00:48,803 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-12-13 12:00:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-12-13 12:00:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:00:48,805 INFO L225 Difference]: With dead ends: 107 [2022-12-13 12:00:48,805 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 12:00:48,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:00:48,805 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:00:48,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:00:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 12:00:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-12-13 12:00:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-12-13 12:00:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-12-13 12:00:48,813 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 63 [2022-12-13 12:00:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:00:48,813 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-12-13 12:00:48,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 12:00:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-12-13 12:00:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 12:00:48,814 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:00:48,814 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:00:48,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:00:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2022-12-13 12:00:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890132214] [2022-12-13 12:00:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:00:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:00:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:00:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:00:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:00:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:00:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:00:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:00:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 12:00:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:50,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 12:00:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 12:00:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890132214] [2022-12-13 12:00:50,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890132214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:00:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810567742] [2022-12-13 12:00:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:00:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:00:50,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:00:50,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:00:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:50,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 12:00:50,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:00:52,789 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3)))))) is different from true [2022-12-13 12:00:58,889 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3)))))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0))) is different from true [2022-12-13 12:01:01,088 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from true [2022-12-13 12:01:03,224 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) is different from true [2022-12-13 12:01:05,324 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) is different from true [2022-12-13 12:01:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2022-12-13 12:01:57,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:02:10,633 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:02:12,664 WARN L837 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0)) is different from false [2022-12-13 12:02:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2022-12-13 12:02:23,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810567742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:02:23,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:02:23,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 21] total 57 [2022-12-13 12:02:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329727886] [2022-12-13 12:02:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:02:23,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-13 12:02:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-13 12:02:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2364, Unknown=23, NotChecked=618, Total=3192 [2022-12-13 12:02:23,608 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-12-13 12:02:25,927 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] [2022-12-13 12:02:27,946 WARN L837 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0))) is different from false [2022-12-13 12:02:29,997 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] [2022-12-13 12:02:32,020 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] [2022-12-13 12:02:34,040 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] [2022-12-13 12:02:36,066 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] [2022-12-13 12:02:38,073 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] [2022-12-13 12:02:44,163 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] [2022-12-13 12:02:48,309 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] [2022-12-13 12:02:50,316 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] [2022-12-13 12:02:56,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 12:03:00,547 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] [2022-12-13 12:03:02,552 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] [2022-12-13 12:03:04,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 12:03:15,468 WARN L837 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0))) is different from false [2022-12-13 12:03:17,490 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0))) is different from true [2022-12-13 12:03:44,687 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, 1] [2022-12-13 12:03:46,770 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] [2022-12-13 12:03:54,867 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] [2022-12-13 12:04:02,913 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] [2022-12-13 12:04:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:04:03,026 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-12-13 12:04:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 12:04:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) Word has length 77 [2022-12-13 12:04:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:04:03,027 INFO L225 Difference]: With dead ends: 92 [2022-12-13 12:04:03,027 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 12:04:03,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 157.1s TimeCoverageRelationStatistics Valid=460, Invalid=4789, Unknown=43, NotChecked=1350, Total=6642 [2022-12-13 12:04:03,029 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 89 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 40 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:04:03,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 581 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 873 Invalid, 17 Unknown, 638 Unchecked, 34.9s Time] [2022-12-13 12:04:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 12:04:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-12-13 12:04:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 59 states have internal predecessors, (60), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-13 12:04:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-12-13 12:04:03,037 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2022-12-13 12:04:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:04:03,037 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-12-13 12:04:03,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-12-13 12:04:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-12-13 12:04:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 12:04:03,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:04:03,038 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:03,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:04:03,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 12:04:03,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:04:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2022-12-13 12:04:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:03,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760998301] [2022-12-13 12:04:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:04:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:04:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:04:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:04:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:04:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:04:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:04:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:04:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 12:04:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 12:04:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 12:04:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:03,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760998301] [2022-12-13 12:04:03,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760998301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:04:03,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862328082] [2022-12-13 12:04:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:03,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:04:03,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:04:03,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:04:03,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:04:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 12:04:03,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:04:05,901 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15|) 0))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15|) 0)))) is different from true [2022-12-13 12:04:08,084 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16|) 0)))) is different from true [2022-12-13 12:04:10,387 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-12-13 12:04:12,436 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0)))) (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse0) |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0)))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse1) |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse1)))))) is different from true [2022-12-13 12:04:14,449 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))))) is different from true [2022-12-13 12:04:17,064 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2022-12-13 12:04:27,387 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:04:37,523 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:04:47,622 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:04:57,773 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:04:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-12-13 12:04:57,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:04:58,097 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 12:04:58,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-12-13 12:04:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 12:04:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862328082] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:04:58,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:04:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 13] total 32 [2022-12-13 12:04:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215290398] [2022-12-13 12:04:58,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:04:58,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 12:04:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:58,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 12:04:58,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=573, Unknown=10, NotChecked=318, Total=992 [2022-12-13 12:04:58,141 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-12-13 12:05:00,299 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] [2022-12-13 12:05:02,312 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] [2022-12-13 12:05:04,316 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] [2022-12-13 12:05:10,366 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] [2022-12-13 12:05:12,375 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] [2022-12-13 12:05:14,381 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] [2022-12-13 12:05:22,468 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] [2022-12-13 12:05:24,473 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] [2022-12-13 12:05:30,523 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] [2022-12-13 12:05:34,557 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] [2022-12-13 12:05:50,900 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:06:11,033 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 53 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:06:29,134 WARN L233 SmtUtils]: Spent 16.07s on a formula simplification. DAG size of input: 56 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:06:53,296 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 59 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:06:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:53,398 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-12-13 12:06:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 12:06:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) Word has length 77 [2022-12-13 12:06:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:06:53,399 INFO L225 Difference]: With dead ends: 98 [2022-12-13 12:06:53,399 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 12:06:53,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 148.7s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=24, NotChecked=438, Total=1722 [2022-12-13 12:06:53,400 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:06:53,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 350 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 10 Unknown, 509 Unchecked, 20.5s Time] [2022-12-13 12:06:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 12:06:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-12-13 12:06:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-13 12:06:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-12-13 12:06:53,410 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2022-12-13 12:06:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:06:53,410 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-12-13 12:06:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-12-13 12:06:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-12-13 12:06:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 12:06:53,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:06:53,411 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-12-13 12:06:53,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:06:53,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:06:53,612 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:06:53,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2022-12-13 12:06:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:53,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975516642] [2022-12-13 12:06:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:06:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:06:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:06:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:06:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:06:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:06:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:06:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:06:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 12:06:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 12:06:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 12:06:54,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975516642] [2022-12-13 12:06:54,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975516642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:06:54,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165966795] [2022-12-13 12:06:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:54,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:54,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:54,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:06:54,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:06:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:54,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 12:06:54,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:06:54,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-13 12:06:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 12:06:54,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:06:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 12:06:54,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165966795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:06:54,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:06:54,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2022-12-13 12:06:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427524431] [2022-12-13 12:06:54,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:06:54,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:06:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:06:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:06:54,479 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 12:06:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:54,727 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-12-13 12:06:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:06:54,727 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), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2022-12-13 12:06:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:06:54,728 INFO L225 Difference]: With dead ends: 101 [2022-12-13 12:06:54,728 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 12:06:54,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:06:54,728 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:06:54,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 305 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:06:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 12:06:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 12:06:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 12:06:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-12-13 12:06:54,738 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 77 [2022-12-13 12:06:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:06:54,738 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-12-13 12:06:54,738 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), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 12:06:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-12-13 12:06:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 12:06:54,739 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:06:54,739 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:54,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 12:06:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:54,940 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:06:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2022-12-13 12:06:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:54,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850021293] [2022-12-13 12:06:54,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:06:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 12:06:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:06:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 12:06:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 12:06:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:06:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:06:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 12:06:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 12:06:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 12:06:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 12:06:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 12:06:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:56,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850021293] [2022-12-13 12:06:56,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850021293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:06:56,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033959609] [2022-12-13 12:06:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:56,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:56,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:56,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:06:56,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:06:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:56,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 12:06:56,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:06:56,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 12:06:56,259 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:06:56,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 12:06:56,266 INFO L350 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 [2022-12-13 12:06:56,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 12:06:56,282 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:06:56,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 12:06:56,287 INFO L350 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 [2022-12-13 12:06:56,293 INFO L350 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 10 treesize of output 8 [2022-12-13 12:06:57,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-12-13 12:06:59,074 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7|) 8)))) is different from true [2022-12-13 12:07:07,333 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8|) 8) |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8|))) is different from true [2022-12-13 12:07:11,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:11,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 19 [2022-12-13 12:07:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 46 refuted. 2 times theorem prover too weak. 15 trivial. 11 not checked. [2022-12-13 12:07:11,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:07:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 12:07:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033959609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:07:13,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:07:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 12] total 40 [2022-12-13 12:07:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855348159] [2022-12-13 12:07:13,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:07:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 12:07:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 12:07:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1267, Unknown=5, NotChecked=146, Total=1560 [2022-12-13 12:07:13,971 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-12-13 12:07:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:07:15,234 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-12-13 12:07:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 12:07:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) Word has length 83 [2022-12-13 12:07:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:07:15,235 INFO L225 Difference]: With dead ends: 77 [2022-12-13 12:07:15,235 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:07:15,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 155 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=297, Invalid=2358, Unknown=5, NotChecked=202, Total=2862 [2022-12-13 12:07:15,237 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 12:07:15,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 336 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 614 Invalid, 0 Unknown, 101 Unchecked, 0.5s Time] [2022-12-13 12:07:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:07:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:07:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:07:15,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-12-13 12:07:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:07:15,238 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:07:15,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-12-13 12:07:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:07:15,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:07:15,240 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:07:15,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 12:07:15,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 12:07:15,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:07:17,100 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-12-13 12:07:17,101 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2022-12-13 12:07:17,102 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-12-13 12:07:17,102 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-12-13 12:07:17,102 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret671#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret671#1|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-12-13 12:07:17,102 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) 0) 0))) [2022-12-13 12:07:17,102 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret335#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2))) [2022-12-13 12:07:17,103 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2022-12-13 12:07:17,103 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2))) [2022-12-13 12:07:17,103 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:07:17,103 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 7393) the Hoare annotation is: true [2022-12-13 12:07:17,103 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-12-13 12:07:17,103 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:07:17,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:07:17,103 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-12-13 12:07:17,103 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret672#1|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret672#1| 1) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-12-13 12:07:17,103 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2))) [2022-12-13 12:07:17,103 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret334#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2))) [2022-12-13 12:07:17,104 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3))) (and (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_#t~mem336#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_#t~mem336#1.offset|))))))) [2022-12-13 12:07:17,104 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2022-12-13 12:07:17,104 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2022-12-13 12:07:17,104 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2022-12-13 12:07:17,104 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2022-12-13 12:07:17,104 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-12-13 12:07:17,105 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2022-12-13 12:07:17,105 INFO L895 garLoopResultBuilder]: At program point aws_linked_list_prev_returnLabel#1(lines 4848 4855) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse1) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) 0) 0))) [2022-12-13 12:07:17,105 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-12-13 12:07:17,105 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2022-12-13 12:07:17,105 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 12:07:17,105 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-12-13 12:07:17,106 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-12-13 12:07:17,106 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-12-13 12:07:17,106 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-12-13 12:07:17,106 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-12-13 12:07:17,106 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2022-12-13 12:07:17,106 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-12-13 12:07:17,109 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:17,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:07:17,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,128 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:07:17 BoogieIcfgContainer [2022-12-13 12:07:17,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:07:17,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:07:17,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:07:17,130 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:07:17,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:59:53" (3/4) ... [2022-12-13 12:07:17,133 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:07:17,137 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-12-13 12:07:17,137 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-12-13 12:07:17,138 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 12:07:17,138 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 12:07:17,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-12-13 12:07:17,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 12:07:17,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:07:17,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:07:17,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((before == 0 && #memory_$Pointer$[node][node + 8] == \result) && #memory_$Pointer$[rval][rval] == node) && before == #memory_$Pointer$[node][node + 8]) && \result == 0) && !(node == 0)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && !(#memory_$Pointer$[node][8] == node)) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && !(rval == 0)) && rval == #memory_$Pointer$[node][node + 8]) && #memory_$Pointer$[\result][0] == 0 [2022-12-13 12:07:17,169 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:07:17,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:07:17,170 INFO L158 Benchmark]: Toolchain (without parser) took 446226.31ms. Allocated memory was 165.7MB in the beginning and 325.1MB in the end (delta: 159.4MB). Free memory was 124.6MB in the beginning and 161.6MB in the end (delta: -37.0MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,170 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory was 137.7MB in the beginning and 137.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:07:17,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1582.65ms. Allocated memory is still 165.7MB. Free memory was 124.6MB in the beginning and 119.2MB in the end (delta: 5.4MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 115.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,171 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 165.7MB. Free memory was 114.9MB in the beginning and 111.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,171 INFO L158 Benchmark]: RCFGBuilder took 400.01ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 92.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,171 INFO L158 Benchmark]: TraceAbstraction took 444114.62ms. Allocated memory was 165.7MB in the beginning and 325.1MB in the end (delta: 159.4MB). Free memory was 92.0MB in the beginning and 165.8MB in the end (delta: -73.9MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,171 INFO L158 Benchmark]: Witness Printer took 39.54ms. Allocated memory is still 325.1MB. Free memory was 165.8MB in the beginning and 161.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:07:17,173 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory was 137.7MB in the beginning and 137.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1582.65ms. Allocated memory is still 165.7MB. Free memory was 124.6MB in the beginning and 119.2MB in the end (delta: 5.4MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 115.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 165.7MB. Free memory was 114.9MB in the beginning and 111.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 400.01ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 92.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 444114.62ms. Allocated memory was 165.7MB in the beginning and 325.1MB in the end (delta: 159.4MB). Free memory was 92.0MB in the beginning and 165.8MB in the end (delta: -73.9MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. * Witness Printer took 39.54ms. Allocated memory is still 325.1MB. Free memory was 165.8MB in the beginning and 161.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 444.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 236.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 57.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 4006 SdHoareTripleChecker+Invalid, 57.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1309 IncrementalHoareTripleChecker+Unchecked, 3272 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3923 IncrementalHoareTripleChecker+Invalid, 5585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 734 mSDtfsCounter, 3923 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1139 GetRequests, 780 SyntacticMatches, 38 SemanticMatches, 321 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 2929 ImplicationChecksByTransitivity, 370.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=13, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 33 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 89 PreInvPairs, 102 NumberOfFragments, 1394 HoareAnnotationTreeSize, 89 FomulaSimplifications, 201 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 6436 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 203.3s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 155 QuantifiedInterpolants, 16890 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 314 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 805/979 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2022-12-13 12:07:17,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:07:17,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:07:17,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((before == 0 && #memory_$Pointer$[node][node + 8] == \result) && #memory_$Pointer$[rval][rval] == node) && before == #memory_$Pointer$[node][node + 8]) && \result == 0) && !(node == 0)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && !(#memory_$Pointer$[node][8] == node)) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && !(rval == 0)) && rval == #memory_$Pointer$[node][node + 8]) && #memory_$Pointer$[\result][0] == 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 12:07:17,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b92289e3-a719-471f-ae74-bfc42bbbfd3d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE