./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8 --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 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --- 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-e04fb08 [2022-11-16 12:13:27,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:13:27,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:13:27,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:13:27,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:13:27,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:13:27,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:13:27,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:13:27,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:13:27,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:13:27,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:13:27,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:13:27,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:13:27,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:13:27,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:13:27,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:13:27,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:13:27,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:13:27,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:13:27,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:13:27,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:13:27,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:13:27,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:13:27,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:13:27,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:13:27,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:13:27,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:13:27,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:13:27,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:13:27,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:13:27,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:13:27,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:13:27,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:13:27,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:13:27,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:13:27,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:13:27,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:13:27,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:13:27,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:13:27,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:13:27,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:13:27,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:13:27,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:13:27,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:13:27,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:13:27,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:13:27,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:13:27,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:13:27,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:13:27,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:13:27,748 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:13:27,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:13:27,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:13:27,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:13:27,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:13:27,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:13:27,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:13:27,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:13:27,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:13:27,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:13:27,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:13:27,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:13:27,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:13:27,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:13:27,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:13:27,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:13:27,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:13:27,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:13:27,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:13:27,755 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:13:27,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:13:27,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:13:27,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8 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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 [2022-11-16 12:13:28,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:13:28,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:13:28,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:13:28,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:13:28,128 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:13:28,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-16 12:13:28,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/509672ec1/cf723188b71b470ea02c789a2e8c20bd/FLAGe99a61ed8 [2022-11-16 12:13:29,192 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:13:29,196 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-16 12:13:29,245 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/509672ec1/cf723188b71b470ea02c789a2e8c20bd/FLAGe99a61ed8 [2022-11-16 12:13:29,695 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/509672ec1/cf723188b71b470ea02c789a2e8c20bd [2022-11-16 12:13:29,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:13:29,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:13:29,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:13:29,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:13:29,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:13:29,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:29" (1/1) ... [2022-11-16 12:13:29,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab988b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:29, skipping insertion in model container [2022-11-16 12:13:29,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:13:29" (1/1) ... [2022-11-16 12:13:29,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:13:29,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:13:30,141 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-16 12:13:30,150 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-16 12:13:31,104 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,105 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,106 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,107 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,108 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,123 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,124 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,127 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,127 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,129 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,131 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,132 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,132 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,482 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:13:31,484 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:13:31,485 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:13:31,487 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:13:31,489 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:13:31,489 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:13:31,490 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:13:31,491 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:13:31,492 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:13:31,493 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:13:31,654 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:13:31,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:13:31,703 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:13:31,718 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-16 12:13:31,719 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-16 12:13:31,834 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,835 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,836 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,837 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,838 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,862 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,862 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,864 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,864 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,866 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,867 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,876 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,877 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:13:31,966 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:13:31,970 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:13:31,972 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:13:31,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:13:31,975 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:13:31,983 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:13:31,984 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:13:31,985 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:13:31,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:13:31,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:13:32,033 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:13:32,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:13:32,371 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:13:32,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32 WrapperNode [2022-11-16 12:13:32,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:13:32,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:13:32,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:13:32,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:13:32,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,532 INFO L138 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2022-11-16 12:13:32,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:13:32,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:13:32,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:13:32,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:13:32,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,617 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:13:32,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:13:32,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:13:32,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:13:32,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (1/1) ... [2022-11-16 12:13:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:13:32,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:32,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:13:32,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:13:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:13:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:13:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:13:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:13:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:13:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:13:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 12:13:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 12:13:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:13:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:13:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2022-11-16 12:13:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2022-11-16 12:13:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:13:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:13:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-16 12:13:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-16 12:13:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:13:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:13:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:13:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:13:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:13:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 12:13:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 12:13:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:13:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:13:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:13:33,127 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:13:33,130 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:13:33,491 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:13:33,514 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:13:33,530 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:13:33,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:33 BoogieIcfgContainer [2022-11-16 12:13:33,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:13:33,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:13:33,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:13:33,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:13:33,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:13:29" (1/3) ... [2022-11-16 12:13:33,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514ec45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:33, skipping insertion in model container [2022-11-16 12:13:33,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:13:32" (2/3) ... [2022-11-16 12:13:33,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514ec45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:13:33, skipping insertion in model container [2022-11-16 12:13:33,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:13:33" (3/3) ... [2022-11-16 12:13:33,568 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2022-11-16 12:13:33,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:13:33,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:13:33,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:13:33,737 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;@7f20ab12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:13:33,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:13:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-16 12:13:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:13:33,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:33,758 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:33,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1286081961, now seen corresponding path program 1 times [2022-11-16 12:13:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:33,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639831190] [2022-11-16 12:13:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:13:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:13:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:13:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:13:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:13:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 12:13:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:13:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:13:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-16 12:13:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:34,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639831190] [2022-11-16 12:13:34,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639831190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:34,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:13:34,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:13:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851054724] [2022-11-16 12:13:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:34,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:13:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:13:34,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:13:34,703 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:13:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:34,783 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-16 12:13:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:13:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-11-16 12:13:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:34,807 INFO L225 Difference]: With dead ends: 188 [2022-11-16 12:13:34,808 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 12:13:34,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:13:34,827 INFO L413 NwaCegarLoop]: 127 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, 127 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-11-16 12:13:34,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:13:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 12:13:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 12:13:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:13:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-16 12:13:34,922 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-16 12:13:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:34,926 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-16 12:13:34,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:13:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-16 12:13:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:13:34,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:34,930 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:34,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:13:34,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1287183985, now seen corresponding path program 1 times [2022-11-16 12:13:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:34,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824660455] [2022-11-16 12:13:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:13:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:13:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:13:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:13:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:13:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 12:13:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:13:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:13:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-16 12:13:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:35,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824660455] [2022-11-16 12:13:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824660455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:35,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995686542] [2022-11-16 12:13:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:35,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:35,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:13:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:36,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 12:13:36,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:36,290 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 18 treesize of output 19 [2022-11-16 12:13:36,309 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 18 treesize of output 19 [2022-11-16 12:13:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:36,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:36,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-16 12:13:36,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:36,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:13:36,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-16 12:13:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-16 12:13:38,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:13:38,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995686542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:38,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:13:38,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-11-16 12:13:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792470696] [2022-11-16 12:13:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:38,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:13:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:13:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:13:38,217 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-16 12:13:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:38,587 INFO L93 Difference]: Finished difference Result 201 states and 273 transitions. [2022-11-16 12:13:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:13:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 84 [2022-11-16 12:13:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:38,592 INFO L225 Difference]: With dead ends: 201 [2022-11-16 12:13:38,593 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 12:13:38,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:13:38,595 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 35 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:38,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 545 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-11-16 12:13:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 12:13:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2022-11-16 12:13:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 88 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-16 12:13:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2022-11-16 12:13:38,621 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 84 [2022-11-16 12:13:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:38,622 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2022-11-16 12:13:38,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-16 12:13:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2022-11-16 12:13:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:13:38,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:38,626 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:13:38,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:13:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:38,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:13:38,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2096530611, now seen corresponding path program 1 times [2022-11-16 12:13:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:38,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222499967] [2022-11-16 12:13:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:38,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:13:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:13:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:13:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:13:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 12:13:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 12:13:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:13:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:13:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-16 12:13:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222499967] [2022-11-16 12:13:39,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222499967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:13:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748046159] [2022-11-16 12:13:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:39,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:13:39,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:13:39,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:13:39,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:13:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:39,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 12:13:39,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:13:39,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:13:39,657 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:13:39,677 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:13:39,677 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:13:41,923 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_6 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_6 24)) 0)))) is different from true [2022-11-16 12:13:44,063 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_7 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_7) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_7 24)) 0)))) is different from true [2022-11-16 12:13:46,224 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_8 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_8) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_8 24)) 0)))) is different from true [2022-11-16 12:13:48,317 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_9 Int) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_9) (+ v_aws_linked_list_front_~list.offset_BEFORE_CALL_9 24)) 0)))) is different from true [2022-11-16 12:13:56,400 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:14:04,603 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:14:12,785 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:14:18,880 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:14:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2022-11-16 12:14:18,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:14:21,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748046159] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:14:21,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:14:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 11] total 27 [2022-11-16 12:14:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903270885] [2022-11-16 12:14:21,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:14:21,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 12:14:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 12:14:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=438, Unknown=8, NotChecked=180, Total=702 [2022-11-16 12:14:21,700 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-16 12:14:58,771 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:15:06,831 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:15:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:15,421 INFO L93 Difference]: Finished difference Result 270 states and 364 transitions. [2022-11-16 12:15:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 12:15:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 84 [2022-11-16 12:15:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:15,425 INFO L225 Difference]: With dead ends: 270 [2022-11-16 12:15:15,429 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 12:15:15,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 93.7s TimeCoverageRelationStatistics Valid=224, Invalid=1175, Unknown=23, NotChecked=300, Total=1722 [2022-11-16 12:15:15,433 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:15,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1271 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 670 Invalid, 0 Unknown, 669 Unchecked, 0.8s Time] [2022-11-16 12:15:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 12:15:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2022-11-16 12:15:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 104 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-16 12:15:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2022-11-16 12:15:15,476 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 84 [2022-11-16 12:15:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:15,478 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2022-11-16 12:15:15,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 25 states have internal predecessors, (95), 6 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-16 12:15:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2022-11-16 12:15:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 12:15:15,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:15,488 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:15,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:15,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:15,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1055778647, now seen corresponding path program 1 times [2022-11-16 12:15:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:15,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365335851] [2022-11-16 12:15:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:15:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:15:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 12:15:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:15:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:15:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 12:15:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:15:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-16 12:15:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365335851] [2022-11-16 12:15:16,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365335851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745346915] [2022-11-16 12:15:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:16,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:16,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:16,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:16,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:15:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:16,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:15:16,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 12:15:16,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:16,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745346915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:16,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:16,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-16 12:15:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059025370] [2022-11-16 12:15:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:16,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:15:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:15:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:15:16,570 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:15:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:16,968 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2022-11-16 12:15:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:15:16,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-11-16 12:15:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:16,976 INFO L225 Difference]: With dead ends: 241 [2022-11-16 12:15:16,977 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 12:15:16,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:15:16,981 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 147 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:16,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 522 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:15:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 12:15:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-16 12:15:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 104 states have internal predecessors, (127), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-16 12:15:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-11-16 12:15:17,012 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 88 [2022-11-16 12:15:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:17,013 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-11-16 12:15:17,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:15:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-11-16 12:15:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 12:15:17,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:17,015 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:17,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:17,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:17,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash 426166840, now seen corresponding path program 1 times [2022-11-16 12:15:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:17,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287576105] [2022-11-16 12:15:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:15:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:15:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 12:15:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:15:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:15:17,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287576105] [2022-11-16 12:15:17,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287576105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:17,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064505171] [2022-11-16 12:15:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:17,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:17,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:17,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:17,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:15:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:17,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:15:17,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:15:18,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:18,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064505171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:18,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:18,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-11-16 12:15:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948448989] [2022-11-16 12:15:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:18,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:15:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:15:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:15:18,018 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:15:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:18,461 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2022-11-16 12:15:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:15:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-11-16 12:15:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:18,464 INFO L225 Difference]: With dead ends: 250 [2022-11-16 12:15:18,464 INFO L226 Difference]: Without dead ends: 154 [2022-11-16 12:15:18,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:15:18,465 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 188 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:18,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 577 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:15:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-16 12:15:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2022-11-16 12:15:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 105 states have internal predecessors, (128), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-16 12:15:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-11-16 12:15:18,485 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 88 [2022-11-16 12:15:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:18,485 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-11-16 12:15:18,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:15:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-11-16 12:15:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 12:15:18,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:18,487 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:18,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:18,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:18,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1868931672, now seen corresponding path program 1 times [2022-11-16 12:15:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:18,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755081885] [2022-11-16 12:15:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:15:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:15:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 12:15:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:15:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:15:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:15:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:15:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:15:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:19,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755081885] [2022-11-16 12:15:19,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755081885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717052273] [2022-11-16 12:15:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:19,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:19,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:15:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:15:19,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 12:15:19,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:19,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717052273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:19,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:19,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-16 12:15:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794529248] [2022-11-16 12:15:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:19,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:15:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:15:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:15:19,420 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:15:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:19,448 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2022-11-16 12:15:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:15:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2022-11-16 12:15:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:19,451 INFO L225 Difference]: With dead ends: 246 [2022-11-16 12:15:19,451 INFO L226 Difference]: Without dead ends: 153 [2022-11-16 12:15:19,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:15:19,453 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:19,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:15:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-16 12:15:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-11-16 12:15:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 106 states have internal predecessors, (129), 30 states have call successors, (30), 15 states have call predecessors, (30), 13 states have return successors, (32), 26 states have call predecessors, (32), 29 states have call successors, (32) [2022-11-16 12:15:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-11-16 12:15:19,489 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 91 [2022-11-16 12:15:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:19,490 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-11-16 12:15:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:15:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-11-16 12:15:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-16 12:15:19,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:19,492 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:19,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:19,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:19,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2072143320, now seen corresponding path program 1 times [2022-11-16 12:15:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:19,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681379575] [2022-11-16 12:15:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:19,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:15:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:15:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:15:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:15:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-16 12:15:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:20,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681379575] [2022-11-16 12:15:20,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681379575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:20,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351742841] [2022-11-16 12:15:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:20,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:20,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:20,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:15:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:20,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 12:15:20,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:20,451 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:20,452 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:20,473 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:20,474 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:15:21,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:15:22,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351742841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:15:22,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:15:22,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2022-11-16 12:15:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460481999] [2022-11-16 12:15:22,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:22,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:15:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:15:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:15:22,199 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-16 12:15:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:23,033 INFO L93 Difference]: Finished difference Result 262 states and 340 transitions. [2022-11-16 12:15:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:15:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 97 [2022-11-16 12:15:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:23,037 INFO L225 Difference]: With dead ends: 262 [2022-11-16 12:15:23,038 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 12:15:23,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 12:15:23,040 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 114 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1248 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-11-16 12:15:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 12:15:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2022-11-16 12:15:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (33), 27 states have call predecessors, (33), 29 states have call successors, (33) [2022-11-16 12:15:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2022-11-16 12:15:23,059 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 97 [2022-11-16 12:15:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:23,059 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2022-11-16 12:15:23,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 7 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-16 12:15:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-11-16 12:15:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-16 12:15:23,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:23,061 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:23,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:23,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:15:23,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1222210787, now seen corresponding path program 1 times [2022-11-16 12:15:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431770456] [2022-11-16 12:15:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:15:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:15:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 12:15:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:15:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:15:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:15:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:15:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-16 12:15:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431770456] [2022-11-16 12:15:24,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431770456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093889774] [2022-11-16 12:15:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:24,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:24,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:15:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:24,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 12:15:24,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:24,459 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:24,460 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:24,477 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:24,477 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:15:25,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-16 12:15:26,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093889774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:15:26,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:15:26,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 26 [2022-11-16 12:15:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114941458] [2022-11-16 12:15:26,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:26,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:15:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:15:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:15:26,561 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-16 12:15:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:29,150 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2022-11-16 12:15:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:15:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 101 [2022-11-16 12:15:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:29,153 INFO L225 Difference]: With dead ends: 397 [2022-11-16 12:15:29,153 INFO L226 Difference]: Without dead ends: 292 [2022-11-16 12:15:29,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 219 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=438, Invalid=1914, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 12:15:29,156 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 337 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:29,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2084 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 993 Invalid, 0 Unknown, 263 Unchecked, 1.1s Time] [2022-11-16 12:15:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-16 12:15:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 243. [2022-11-16 12:15:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 187 states have internal predecessors, (232), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-16 12:15:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 319 transitions. [2022-11-16 12:15:29,189 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 319 transitions. Word has length 101 [2022-11-16 12:15:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:29,189 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 319 transitions. [2022-11-16 12:15:29,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 7 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-11-16 12:15:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 319 transitions. [2022-11-16 12:15:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-16 12:15:29,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:29,192 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:29,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 12:15:29,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -853016413, now seen corresponding path program 1 times [2022-11-16 12:15:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675954150] [2022-11-16 12:15:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:15:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:15:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 12:15:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:15:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:15:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:15:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:15:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 12:15:29,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:29,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675954150] [2022-11-16 12:15:29,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675954150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:29,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75761328] [2022-11-16 12:15:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:29,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:29,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:15:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:29,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:15:29,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 12:15:29,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:29,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75761328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:29,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:29,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 12:15:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818937261] [2022-11-16 12:15:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:15:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:15:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:15:29,956 INFO L87 Difference]: Start difference. First operand 243 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:15:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:30,007 INFO L93 Difference]: Finished difference Result 390 states and 520 transitions. [2022-11-16 12:15:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:15:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-11-16 12:15:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:30,010 INFO L225 Difference]: With dead ends: 390 [2022-11-16 12:15:30,010 INFO L226 Difference]: Without dead ends: 238 [2022-11-16 12:15:30,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:15:30,014 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:30,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:15:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-16 12:15:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-11-16 12:15:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 177 states have (on average 1.2485875706214689) internal successors, (221), 182 states have internal predecessors, (221), 38 states have call successors, (38), 20 states have call predecessors, (38), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-16 12:15:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 308 transitions. [2022-11-16 12:15:30,046 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 308 transitions. Word has length 101 [2022-11-16 12:15:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:30,047 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 308 transitions. [2022-11-16 12:15:30,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:15:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 308 transitions. [2022-11-16 12:15:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-16 12:15:30,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:30,049 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:30,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:30,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:30,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash -550482073, now seen corresponding path program 1 times [2022-11-16 12:15:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363810389] [2022-11-16 12:15:30,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 12:15:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:15:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 12:15:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:15:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:15:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:15:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:15:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 12:15:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:30,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363810389] [2022-11-16 12:15:30,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363810389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:30,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559716221] [2022-11-16 12:15:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:30,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:30,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:30,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:15:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:30,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:15:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-16 12:15:30,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:30,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559716221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:30,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:30,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 12:15:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117063446] [2022-11-16 12:15:30,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:15:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:30,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:15:30,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:15:30,839 INFO L87 Difference]: Start difference. First operand 238 states and 308 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:15:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:30,873 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2022-11-16 12:15:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:15:30,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-11-16 12:15:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:30,876 INFO L225 Difference]: With dead ends: 328 [2022-11-16 12:15:30,876 INFO L226 Difference]: Without dead ends: 168 [2022-11-16 12:15:30,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:15:30,878 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:30,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 351 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:15:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-16 12:15:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-11-16 12:15:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 117 states have internal predecessors, (135), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-16 12:15:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2022-11-16 12:15:30,899 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 101 [2022-11-16 12:15:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:30,899 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2022-11-16 12:15:30,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:15:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-11-16 12:15:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-16 12:15:30,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:30,902 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:30,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:31,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:15:31,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1237588355, now seen corresponding path program 1 times [2022-11-16 12:15:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:31,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614733719] [2022-11-16 12:15:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:15:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:15:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:15:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 12:15:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-16 12:15:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614733719] [2022-11-16 12:15:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614733719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:32,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803440794] [2022-11-16 12:15:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:32,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:32,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:15:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 12:15:32,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:32,399 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:32,399 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:15:33,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:34,473 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 236 treesize of output 220 [2022-11-16 12:15:34,482 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 220 treesize of output 212 [2022-11-16 12:15:34,503 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 212 treesize of output 196 [2022-11-16 12:15:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 12:15:34,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803440794] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:15:34,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:15:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 38 [2022-11-16 12:15:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226687066] [2022-11-16 12:15:34,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 12:15:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 12:15:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 12:15:34,681 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-16 12:15:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:37,285 INFO L93 Difference]: Finished difference Result 418 states and 523 transitions. [2022-11-16 12:15:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:15:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) Word has length 100 [2022-11-16 12:15:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:37,288 INFO L225 Difference]: With dead ends: 418 [2022-11-16 12:15:37,288 INFO L226 Difference]: Without dead ends: 330 [2022-11-16 12:15:37,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=409, Invalid=3373, Unknown=0, NotChecked=0, Total=3782 [2022-11-16 12:15:37,291 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 726 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:37,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2344 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1597 Invalid, 0 Unknown, 150 Unchecked, 1.6s Time] [2022-11-16 12:15:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-16 12:15:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 248. [2022-11-16 12:15:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 179 states have (on average 1.1955307262569832) internal successors, (214), 183 states have internal predecessors, (214), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2022-11-16 12:15:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 307 transitions. [2022-11-16 12:15:37,327 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 307 transitions. Word has length 100 [2022-11-16 12:15:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:37,328 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 307 transitions. [2022-11-16 12:15:37,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 3.342857142857143) internal successors, (117), 35 states have internal predecessors, (117), 15 states have call successors, (31), 6 states have call predecessors, (31), 7 states have return successors, (27), 12 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-16 12:15:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 307 transitions. [2022-11-16 12:15:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-16 12:15:37,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:37,331 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:37,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:37,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 226471105, now seen corresponding path program 1 times [2022-11-16 12:15:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708257348] [2022-11-16 12:15:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:15:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:15:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:15:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 12:15:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-16 12:15:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708257348] [2022-11-16 12:15:37,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708257348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:37,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:15:37,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:15:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197907921] [2022-11-16 12:15:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:37,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:15:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:15:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:15:37,876 INFO L87 Difference]: Start difference. First operand 248 states and 307 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:15:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:37,990 INFO L93 Difference]: Finished difference Result 517 states and 650 transitions. [2022-11-16 12:15:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:15:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-11-16 12:15:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:37,992 INFO L225 Difference]: With dead ends: 517 [2022-11-16 12:15:37,993 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 12:15:37,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:15:37,995 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 39 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:37,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 673 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:15:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 12:15:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-16 12:15:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 172 states have (on average 1.1744186046511629) internal successors, (202), 176 states have internal predecessors, (202), 43 states have call successors, (43), 24 states have call predecessors, (43), 25 states have return successors, (50), 40 states have call predecessors, (50), 42 states have call successors, (50) [2022-11-16 12:15:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 295 transitions. [2022-11-16 12:15:38,028 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 295 transitions. Word has length 100 [2022-11-16 12:15:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:38,029 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 295 transitions. [2022-11-16 12:15:38,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:15:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 295 transitions. [2022-11-16 12:15:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 12:15:38,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:38,033 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 12:15:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:15:38,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1093244626, now seen corresponding path program 1 times [2022-11-16 12:15:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:38,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703845923] [2022-11-16 12:15:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:15:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:15:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:15:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:15:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:15:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 12:15:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:38,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703845923] [2022-11-16 12:15:38,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703845923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244973781] [2022-11-16 12:15:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:38,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:38,846 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:38,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:15:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:39,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:15:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 12:15:39,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:15:39,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244973781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:39,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:15:39,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2022-11-16 12:15:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531482903] [2022-11-16 12:15:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:39,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:15:39,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:15:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:15:39,480 INFO L87 Difference]: Start difference. First operand 241 states and 295 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-16 12:15:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:39,783 INFO L93 Difference]: Finished difference Result 421 states and 528 transitions. [2022-11-16 12:15:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:15:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2022-11-16 12:15:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:39,786 INFO L225 Difference]: With dead ends: 421 [2022-11-16 12:15:39,787 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 12:15:39,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:15:39,788 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 20 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:39,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 796 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-11-16 12:15:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 12:15:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 253. [2022-11-16 12:15:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.1813186813186813) internal successors, (215), 187 states have internal predecessors, (215), 43 states have call successors, (43), 24 states have call predecessors, (43), 27 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-16 12:15:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 312 transitions. [2022-11-16 12:15:39,823 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 312 transitions. Word has length 110 [2022-11-16 12:15:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:39,824 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 312 transitions. [2022-11-16 12:15:39,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-16 12:15:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 312 transitions. [2022-11-16 12:15:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 12:15:39,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:39,826 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 12:15:39,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:40,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:40,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1262560624, now seen corresponding path program 1 times [2022-11-16 12:15:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:40,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19967769] [2022-11-16 12:15:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:40,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:15:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:15:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:15:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:15:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:15:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:15:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:40,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19967769] [2022-11-16 12:15:40,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19967769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:40,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987129971] [2022-11-16 12:15:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:40,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:40,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:40,980 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:41,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:15:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:41,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 12:15:41,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:41,315 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:41,315 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:41,330 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:15:41,330 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 12:15:43,529 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-11-16 12:15:45,614 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2022-11-16 12:15:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 7 not checked. [2022-11-16 12:15:46,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:15:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-16 12:15:47,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987129971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:15:47,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:15:47,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 11] total 29 [2022-11-16 12:15:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933169130] [2022-11-16 12:15:47,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:47,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 12:15:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 12:15:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=620, Unknown=2, NotChecked=102, Total=812 [2022-11-16 12:15:47,396 INFO L87 Difference]: Start difference. First operand 253 states and 312 transitions. Second operand has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-16 12:15:49,788 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_7|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_7|) 0))))) is different from true [2022-11-16 12:15:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:50,420 INFO L93 Difference]: Finished difference Result 372 states and 469 transitions. [2022-11-16 12:15:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:15:50,421 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 110 [2022-11-16 12:15:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:50,426 INFO L225 Difference]: With dead ends: 372 [2022-11-16 12:15:50,426 INFO L226 Difference]: Without dead ends: 272 [2022-11-16 12:15:50,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=235, Invalid=1496, Unknown=3, NotChecked=246, Total=1980 [2022-11-16 12:15:50,428 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 139 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:50,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1665 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 462 Invalid, 0 Unknown, 459 Unchecked, 0.4s Time] [2022-11-16 12:15:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-16 12:15:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 242. [2022-11-16 12:15:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 172 states have (on average 1.186046511627907) internal successors, (204), 177 states have internal predecessors, (204), 43 states have call successors, (43), 23 states have call predecessors, (43), 26 states have return successors, (53), 41 states have call predecessors, (53), 42 states have call successors, (53) [2022-11-16 12:15:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 300 transitions. [2022-11-16 12:15:50,468 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 300 transitions. Word has length 110 [2022-11-16 12:15:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:50,469 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 300 transitions. [2022-11-16 12:15:50,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 28 states have internal predecessors, (112), 10 states have call successors, (27), 6 states have call predecessors, (27), 7 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-16 12:15:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 300 transitions. [2022-11-16 12:15:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-16 12:15:50,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:50,472 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:50,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:15:50,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:15:50,678 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1963183712, now seen corresponding path program 1 times [2022-11-16 12:15:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:50,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757870737] [2022-11-16 12:15:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:50,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:15:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:15:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 12:15:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:15:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:15:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:15:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:15:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 12:15:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:15:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-16 12:15:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757870737] [2022-11-16 12:15:52,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757870737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:15:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329959839] [2022-11-16 12:15:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:52,534 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:52,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:15:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:52,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-16 12:15:52,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:15:52,954 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 12:15:52,959 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:15:52,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 12:15:52,973 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:15:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:15:56,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:16:10,613 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:16:20,850 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:16:22,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:22,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3578 treesize of output 3242 [2022-11-16 12:16:23,278 INFO L321 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2022-11-16 12:16:23,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 44375 treesize of output 41309 [2022-11-16 12:16:23,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:23,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48552 treesize of output 47150 [2022-11-16 12:16:27,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:27,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44633 treesize of output 44005 [2022-11-16 12:16:27,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:27,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45166 treesize of output 45028 [2022-11-16 12:16:28,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:28,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 44734 treesize of output 44707 [2022-11-16 12:17:14,189 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 12:17:14,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:14,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:17:14,396 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-16 12:17:14,401 INFO L158 Benchmark]: Toolchain (without parser) took 224701.61ms. Allocated memory was 96.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 67.6MB in the beginning and 790.2MB in the end (delta: -722.6MB). Peak memory consumption was 718.3MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,402 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 96.5MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:17:14,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2687.49ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 67.4MB in the beginning and 76.9MB in the end (delta: -9.5MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.21ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 71.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,403 INFO L158 Benchmark]: Boogie Preprocessor took 103.74ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,404 INFO L158 Benchmark]: RCFGBuilder took 894.66ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 42.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,404 INFO L158 Benchmark]: TraceAbstraction took 220843.48ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 107.9MB in the beginning and 790.2MB in the end (delta: -682.4MB). Peak memory consumption was 706.9MB. Max. memory is 16.1GB. [2022-11-16 12:17:14,406 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.43ms. Allocated memory is still 96.5MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2687.49ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 67.4MB in the beginning and 76.9MB in the end (delta: -9.5MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.21ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 71.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.74ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 894.66ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 42.0MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 220843.48ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 107.9MB in the beginning and 790.2MB in the end (delta: -682.4MB). Peak memory consumption was 706.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-16 12:17:14,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8 --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 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 --- 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-e04fb08 [2022-11-16 12:17:16,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:17:16,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:17:16,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:17:16,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:17:16,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:17:16,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:17:16,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:17:16,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:17:16,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:17:16,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:17:16,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:17:16,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:17:17,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:17:17,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:17:17,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:17:17,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:17:17,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:17:17,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:17:17,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:17:17,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:17:17,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:17:17,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:17:17,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:17:17,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:17:17,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:17:17,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:17:17,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:17:17,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:17:17,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:17:17,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:17:17,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:17:17,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:17:17,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:17:17,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:17:17,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:17:17,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:17:17,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:17:17,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:17:17,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:17:17,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:17:17,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 12:17:17,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:17:17,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:17:17,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:17:17,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:17:17,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:17:17,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:17:17,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:17:17,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:17:17,097 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:17:17,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:17:17,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:17:17,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:17:17,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:17:17,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:17:17,099 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:17:17,099 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:17:17,099 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:17:17,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:17:17,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:17:17,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:17:17,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:17:17,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:17:17,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:17:17,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:17,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:17:17,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:17:17,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:17:17,102 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:17:17,102 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:17:17,103 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:17:17,103 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:17:17,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:17:17,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:17:17,104 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8 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 -> 61592663790a1842b8bd7e9befeca1c276604b90aee8701db027349608c78395 [2022-11-16 12:17:17,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:17:17,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:17:17,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:17:17,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:17:17,553 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:17:17,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-16 12:17:17,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/8751babe3/cac1dff380a24c5b9654524261072523/FLAGc0e6d1985 [2022-11-16 12:17:18,620 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:17:18,620 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2022-11-16 12:17:18,677 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/8751babe3/cac1dff380a24c5b9654524261072523/FLAGc0e6d1985 [2022-11-16 12:17:19,168 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/data/8751babe3/cac1dff380a24c5b9654524261072523 [2022-11-16 12:17:19,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:17:19,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:17:19,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:19,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:17:19,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:17:19,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:19" (1/1) ... [2022-11-16 12:17:19,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cebb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:19, skipping insertion in model container [2022-11-16 12:17:19,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:19" (1/1) ... [2022-11-16 12:17:19,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:17:19,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:19,669 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-16 12:17:19,678 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-16 12:17:20,818 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,824 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,825 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,828 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,831 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,848 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,849 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,851 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,851 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,854 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,855 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,856 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:20,857 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,354 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:17:21,356 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:17:21,357 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:17:21,358 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:17:21,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:17:21,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:17:21,361 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:17:21,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:17:21,363 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:17:21,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:17:21,546 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:17:21,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:21,611 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:17:21,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:21,653 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-16 12:17:21,654 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-16 12:17:21,701 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,702 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,703 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,703 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,704 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,714 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,715 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,716 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,717 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,719 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,720 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,720 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,721 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,768 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:17:21,783 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:17:21,784 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:17:21,785 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:17:21,787 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:17:21,788 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:17:21,788 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:17:21,789 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:17:21,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:17:21,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:17:21,817 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:17:21,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:21,843 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:17:21,857 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2022-11-16 12:17:21,858 WARN L229 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_a8fbe959-097c-4fb8-8dfa-3e1f846be615/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2022-11-16 12:17:21,900 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,900 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,901 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,901 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,902 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,909 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,909 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,911 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,911 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,912 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,913 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,914 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,914 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:17:21,952 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:17:21,953 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:17:21,954 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:17:21,955 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:17:21,956 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:17:21,956 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:17:21,957 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:17:21,958 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:17:21,958 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:17:21,959 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:17:22,006 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:17:22,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:22,295 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:17:22,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22 WrapperNode [2022-11-16 12:17:22,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:22,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:22,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:17:22,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:17:22,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,481 INFO L138 Inliner]: procedures = 698, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 135 [2022-11-16 12:17:22,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:22,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:17:22,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:17:22,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:17:22,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,588 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:17:22,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:17:22,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:17:22,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:17:22,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (1/1) ... [2022-11-16 12:17:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:22,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:22,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:17:22,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:17:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:17:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:17:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:17:22,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:17:22,721 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:17:22,722 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 12:17:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:17:22,722 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 12:17:22,722 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 12:17:22,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:17:22,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:17:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2022-11-16 12:17:22,724 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2022-11-16 12:17:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:17:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:17:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-16 12:17:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-16 12:17:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:17:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:17:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:17:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:17:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:17:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 12:17:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 12:17:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:17:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 12:17:23,115 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:17:23,118 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:17:23,610 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:17:23,632 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:17:23,632 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:17:23,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:23 BoogieIcfgContainer [2022-11-16 12:17:23,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:17:23,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:17:23,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:17:23,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:17:23,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:19" (1/3) ... [2022-11-16 12:17:23,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e79310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:23, skipping insertion in model container [2022-11-16 12:17:23,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22" (2/3) ... [2022-11-16 12:17:23,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e79310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:23, skipping insertion in model container [2022-11-16 12:17:23,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:23" (3/3) ... [2022-11-16 12:17:23,650 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2022-11-16 12:17:23,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:17:23,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:17:23,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:17:23,724 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;@7a4ee04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:17:23,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:17:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-16 12:17:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:17:23,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:23,742 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:23,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1286081961, now seen corresponding path program 1 times [2022-11-16 12:17:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:23,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690054068] [2022-11-16 12:17:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:23,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:23,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:17:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:17:24,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 12:17:24,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:24,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690054068] [2022-11-16 12:17:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690054068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:24,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624905195] [2022-11-16 12:17:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:24,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:17:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:17:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:17:24,279 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:17:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:24,322 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-11-16 12:17:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:17:24,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2022-11-16 12:17:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:24,338 INFO L225 Difference]: With dead ends: 188 [2022-11-16 12:17:24,339 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 12:17:24,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-11-16 12:17:24,361 INFO L413 NwaCegarLoop]: 127 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, 127 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-11-16 12:17:24,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 12:17:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 12:17:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:17:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-11-16 12:17:24,414 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-11-16 12:17:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:24,415 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-11-16 12:17:24,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:17:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-11-16 12:17:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-16 12:17:24,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:24,419 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:24,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:24,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1287183985, now seen corresponding path program 1 times [2022-11-16 12:17:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:24,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891514699] [2022-11-16 12:17:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:24,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:24,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:17:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:24,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:25,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:25,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891514699] [2022-11-16 12:17:25,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891514699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:25,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:25,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086204608] [2022-11-16 12:17:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:25,100 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:17:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:25,309 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2022-11-16 12:17:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:17:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2022-11-16 12:17:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:25,315 INFO L225 Difference]: With dead ends: 169 [2022-11-16 12:17:25,317 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 12:17:25,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:25,320 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:25,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 558 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 12:17:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-16 12:17:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-16 12:17:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2022-11-16 12:17:25,341 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2022-11-16 12:17:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:25,341 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2022-11-16 12:17:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:17:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2022-11-16 12:17:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-16 12:17:25,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:25,345 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:25,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:25,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:25,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 415994251, now seen corresponding path program 1 times [2022-11-16 12:17:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924832371] [2022-11-16 12:17:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:25,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:25,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:17:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:17:25,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:26,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:26,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:26,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924832371] [2022-11-16 12:17:26,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924832371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:26,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:26,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:17:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623253198] [2022-11-16 12:17:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:26,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:17:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:17:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:17:26,014 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:26,430 INFO L93 Difference]: Finished difference Result 174 states and 231 transitions. [2022-11-16 12:17:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2022-11-16 12:17:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:26,439 INFO L225 Difference]: With dead ends: 174 [2022-11-16 12:17:26,439 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 12:17:26,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:17:26,441 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:26,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 637 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:17:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 12:17:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-16 12:17:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-16 12:17:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2022-11-16 12:17:26,460 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2022-11-16 12:17:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2022-11-16 12:17:26,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2022-11-16 12:17:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 12:17:26,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:26,464 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:26,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:26,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:26,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 426166840, now seen corresponding path program 1 times [2022-11-16 12:17:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:26,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99353755] [2022-11-16 12:17:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:26,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:26,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:26,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:17:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:17:27,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:27,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:27,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99353755] [2022-11-16 12:17:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99353755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:27,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:27,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:17:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922185191] [2022-11-16 12:17:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:27,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:17:27,243 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:27,797 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2022-11-16 12:17:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-11-16 12:17:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:27,802 INFO L225 Difference]: With dead ends: 183 [2022-11-16 12:17:27,802 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 12:17:27,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:17:27,804 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:27,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 716 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:17:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 12:17:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-11-16 12:17:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-16 12:17:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-11-16 12:17:27,845 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2022-11-16 12:17:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:27,846 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-11-16 12:17:27,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-11-16 12:17:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-16 12:17:27,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:27,853 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:27,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:28,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:28,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash 134211126, now seen corresponding path program 1 times [2022-11-16 12:17:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:28,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898617606] [2022-11-16 12:17:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:28,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:28,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:28,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:28,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:17:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:28,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:17:28,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:17:28,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:28,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:28,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898617606] [2022-11-16 12:17:28,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898617606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:28,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:28,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:17:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242885175] [2022-11-16 12:17:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:28,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:17:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:17:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:17:28,586 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:29,004 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-11-16 12:17:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2022-11-16 12:17:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:29,007 INFO L225 Difference]: With dead ends: 179 [2022-11-16 12:17:29,007 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 12:17:29,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:17:29,009 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:29,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 624 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:17:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 12:17:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-16 12:17:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-16 12:17:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-11-16 12:17:29,039 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2022-11-16 12:17:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:29,040 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-11-16 12:17:29,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:17:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-11-16 12:17:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-16 12:17:29,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:29,043 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:29,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:29,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2072143320, now seen corresponding path program 1 times [2022-11-16 12:17:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:29,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267342586] [2022-11-16 12:17:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:29,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:29,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:17:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:17:29,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:29,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:29,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:29,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267342586] [2022-11-16 12:17:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267342586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:29,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:29,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:17:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835406455] [2022-11-16 12:17:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:29,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:29,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:29,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:29,647 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-16 12:17:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:29,794 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2022-11-16 12:17:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-11-16 12:17:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:29,799 INFO L225 Difference]: With dead ends: 178 [2022-11-16 12:17:29,799 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 12:17:29,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:17:29,801 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:29,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 12:17:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-11-16 12:17:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-16 12:17:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-11-16 12:17:29,819 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2022-11-16 12:17:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:29,820 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-11-16 12:17:29,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-16 12:17:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-11-16 12:17:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-16 12:17:29,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:29,822 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:29,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:30,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:30,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1447444667, now seen corresponding path program 1 times [2022-11-16 12:17:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:30,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130432212] [2022-11-16 12:17:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:30,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:30,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:17:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:17:30,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:33,041 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2022-11-16 12:17:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:17:33,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-16 12:17:33,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130432212] [2022-11-16 12:17:33,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130432212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:33,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:33,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-11-16 12:17:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485936010] [2022-11-16 12:17:33,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:33,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:17:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:17:33,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-11-16 12:17:33,933 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-16 12:17:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:35,772 INFO L93 Difference]: Finished difference Result 248 states and 342 transitions. [2022-11-16 12:17:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:17:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2022-11-16 12:17:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:35,776 INFO L225 Difference]: With dead ends: 248 [2022-11-16 12:17:35,776 INFO L226 Difference]: Without dead ends: 169 [2022-11-16 12:17:35,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=105, Invalid=360, Unknown=1, NotChecked=40, Total=506 [2022-11-16 12:17:35,778 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 177 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:35,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 848 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 328 Invalid, 0 Unknown, 213 Unchecked, 1.1s Time] [2022-11-16 12:17:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-16 12:17:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 116. [2022-11-16 12:17:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.25) internal successors, (100), 82 states have internal predecessors, (100), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-16 12:17:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2022-11-16 12:17:35,809 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 99 [2022-11-16 12:17:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:35,809 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2022-11-16 12:17:35,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-16 12:17:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2022-11-16 12:17:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-16 12:17:35,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:35,812 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:35,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:36,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:36,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 514129991, now seen corresponding path program 1 times [2022-11-16 12:17:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:36,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509538529] [2022-11-16 12:17:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:36,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:36,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:36,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:36,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:17:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:36,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:36,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 12:17:36,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:36,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509538529] [2022-11-16 12:17:36,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509538529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:36,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:36,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803471117] [2022-11-16 12:17:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:36,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:36,307 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:17:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:36,369 INFO L93 Difference]: Finished difference Result 216 states and 290 transitions. [2022-11-16 12:17:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:17:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-16 12:17:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:36,372 INFO L225 Difference]: With dead ends: 216 [2022-11-16 12:17:36,372 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 12:17:36,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:17:36,374 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:36,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 361 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 12:17:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-11-16 12:17:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.2375) internal successors, (99), 82 states have internal predecessors, (99), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-16 12:17:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2022-11-16 12:17:36,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 99 [2022-11-16 12:17:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:36,395 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2022-11-16 12:17:36,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:17:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2022-11-16 12:17:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-16 12:17:36,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:36,397 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:36,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:36,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1074829769, now seen corresponding path program 1 times [2022-11-16 12:17:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:36,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102753830] [2022-11-16 12:17:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:36,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:36,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:36,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:36,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:17:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:36,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:17:36,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-16 12:17:36,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:36,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102753830] [2022-11-16 12:17:36,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102753830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:36,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:36,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:17:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486813690] [2022-11-16 12:17:36,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:36,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:17:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:17:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:17:36,916 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:17:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:37,003 INFO L93 Difference]: Finished difference Result 214 states and 287 transitions. [2022-11-16 12:17:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-16 12:17:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:37,006 INFO L225 Difference]: With dead ends: 214 [2022-11-16 12:17:37,006 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 12:17:37,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:17:37,008 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:37,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 467 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 12:17:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2022-11-16 12:17:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-16 12:17:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-11-16 12:17:37,028 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 99 [2022-11-16 12:17:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:37,029 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-11-16 12:17:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:17:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-11-16 12:17:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-16 12:17:37,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:37,031 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:37,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:37,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:37,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2113170743, now seen corresponding path program 1 times [2022-11-16 12:17:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:37,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824570990] [2022-11-16 12:17:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:17:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:37,248 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:17:37,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:17:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:37,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:17:37,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:40,329 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_4) (_ bv0 64)) v_aws_linked_list_front_~list.base_BEFORE_CALL_4))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_4) (_ bv0 64)) (_ bv16 64))))) is different from true [2022-11-16 12:17:48,585 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:17:56,992 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:05,317 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:13,894 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:22,287 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:18:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 12:18:22,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:29,403 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:18:29,404 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 26 treesize of output 25 [2022-11-16 12:18:29,429 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 12:18:29,430 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 16 [2022-11-16 12:18:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 12:18:29,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:18:29,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824570990] [2022-11-16 12:18:29,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824570990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:29,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:29,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2022-11-16 12:18:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414303178] [2022-11-16 12:18:29,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:29,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 12:18:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:18:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 12:18:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2022-11-16 12:18:29,466 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-16 12:18:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:34,332 INFO L93 Difference]: Finished difference Result 257 states and 332 transitions. [2022-11-16 12:18:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:18:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 100 [2022-11-16 12:18:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:34,335 INFO L225 Difference]: With dead ends: 257 [2022-11-16 12:18:34,335 INFO L226 Difference]: Without dead ends: 145 [2022-11-16 12:18:34,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=115, Invalid=943, Unknown=2, NotChecked=62, Total=1122 [2022-11-16 12:18:34,337 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 82 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:34,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1094 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 722 Invalid, 0 Unknown, 428 Unchecked, 4.0s Time] [2022-11-16 12:18:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-16 12:18:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-11-16 12:18:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 98 states have internal predecessors, (117), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2022-11-16 12:18:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2022-11-16 12:18:34,357 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 100 [2022-11-16 12:18:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:34,358 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2022-11-16 12:18:34,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-16 12:18:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2022-11-16 12:18:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 12:18:34,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:34,360 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:34,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:34,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:34,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2037452824, now seen corresponding path program 2 times [2022-11-16 12:18:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:18:34,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420890824] [2022-11-16 12:18:34,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:18:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:18:34,579 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:18:34,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:18:34,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:18:34,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:18:34,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:18:34,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-16 12:18:38,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:41,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:18:41,520 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 30 treesize of output 29 [2022-11-16 12:18:41,559 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:18:41,560 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 19 [2022-11-16 12:18:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-16 12:18:41,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:18:41,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420890824] [2022-11-16 12:18:41,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420890824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:41,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:41,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-11-16 12:18:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452453814] [2022-11-16 12:18:41,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:18:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:18:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:18:41,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:18:41,656 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 12:18:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:43,488 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2022-11-16 12:18:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:18:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 110 [2022-11-16 12:18:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:43,491 INFO L225 Difference]: With dead ends: 256 [2022-11-16 12:18:43,491 INFO L226 Difference]: Without dead ends: 174 [2022-11-16 12:18:43,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:18:43,493 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 90 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:43,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1122 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 112 Unchecked, 1.1s Time] [2022-11-16 12:18:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-16 12:18:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2022-11-16 12:18:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.218487394957983) internal successors, (145), 120 states have internal predecessors, (145), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2022-11-16 12:18:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-11-16 12:18:43,522 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 110 [2022-11-16 12:18:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:43,523 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-11-16 12:18:43,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 12:18:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-11-16 12:18:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 12:18:43,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:43,525 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:43,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:43,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:43,725 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1228106198, now seen corresponding path program 1 times [2022-11-16 12:18:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:18:43,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676551236] [2022-11-16 12:18:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:43,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:43,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:18:43,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:18:43,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:18:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:43,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:18:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-16 12:18:44,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:45,900 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:18:45,900 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-11-16 12:18:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 12:18:46,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:18:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676551236] [2022-11-16 12:18:46,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676551236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:46,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-11-16 12:18:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242596585] [2022-11-16 12:18:46,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:46,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:18:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:18:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:18:46,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=231, Unknown=2, NotChecked=0, Total=272 [2022-11-16 12:18:46,124 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 12:18:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:49,349 INFO L93 Difference]: Finished difference Result 348 states and 466 transitions. [2022-11-16 12:18:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:18:49,351 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 110 [2022-11-16 12:18:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:49,352 INFO L225 Difference]: With dead ends: 348 [2022-11-16 12:18:49,353 INFO L226 Difference]: Without dead ends: 235 [2022-11-16 12:18:49,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=170, Invalid=880, Unknown=6, NotChecked=0, Total=1056 [2022-11-16 12:18:49,355 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 145 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:49,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1204 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 490 Invalid, 0 Unknown, 17 Unchecked, 1.6s Time] [2022-11-16 12:18:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-16 12:18:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 167. [2022-11-16 12:18:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 124 states have internal predecessors, (150), 27 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2022-11-16 12:18:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2022-11-16 12:18:49,386 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 110 [2022-11-16 12:18:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:49,387 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2022-11-16 12:18:49,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 15 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 12:18:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2022-11-16 12:18:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-16 12:18:49,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:49,389 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:49,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:49,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1127699052, now seen corresponding path program 1 times [2022-11-16 12:18:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:18:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723880714] [2022-11-16 12:18:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:49,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:18:49,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:18:49,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:18:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:49,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:18:49,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:18:49,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:18:49,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:18:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723880714] [2022-11-16 12:18:49,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723880714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:49,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:49,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:18:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124724588] [2022-11-16 12:18:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:49,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:18:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:18:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:18:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:18:49,950 INFO L87 Difference]: Start difference. First operand 167 states and 211 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:18:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:50,009 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2022-11-16 12:18:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:18:50,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2022-11-16 12:18:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:50,011 INFO L225 Difference]: With dead ends: 288 [2022-11-16 12:18:50,011 INFO L226 Difference]: Without dead ends: 170 [2022-11-16 12:18:50,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:18:50,013 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:50,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:18:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-16 12:18:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2022-11-16 12:18:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 123 states have internal predecessors, (147), 27 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (33), 27 states have call predecessors, (33), 26 states have call successors, (33) [2022-11-16 12:18:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2022-11-16 12:18:50,037 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 110 [2022-11-16 12:18:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:50,038 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2022-11-16 12:18:50,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:18:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2022-11-16 12:18:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:18:50,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:50,040 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:50,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-16 12:18:50,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:50,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2030089748, now seen corresponding path program 1 times [2022-11-16 12:18:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:18:50,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40963031] [2022-11-16 12:18:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:18:50,259 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:18:50,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:18:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:50,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:18:50,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:50,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 12:18:50,700 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 6 treesize of output 5 [2022-11-16 12:18:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-16 12:18:53,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:18:53,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:18:53,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40963031] [2022-11-16 12:18:53,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40963031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:53,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:53,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:18:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607850193] [2022-11-16 12:18:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:53,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:18:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:18:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:18:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:18:53,024 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:18:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:53,907 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-11-16 12:18:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:18:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 111 [2022-11-16 12:18:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:53,911 INFO L225 Difference]: With dead ends: 376 [2022-11-16 12:18:53,911 INFO L226 Difference]: Without dead ends: 280 [2022-11-16 12:18:53,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:18:53,912 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 34 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:53,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 972 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 212 Unchecked, 0.7s Time] [2022-11-16 12:18:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-16 12:18:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2022-11-16 12:18:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 198 states have (on average 1.196969696969697) internal successors, (237), 200 states have internal predecessors, (237), 40 states have call successors, (40), 25 states have call predecessors, (40), 26 states have return successors, (52), 39 states have call predecessors, (52), 39 states have call successors, (52) [2022-11-16 12:18:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2022-11-16 12:18:53,987 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 111 [2022-11-16 12:18:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:53,988 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2022-11-16 12:18:53,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:18:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2022-11-16 12:18:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:18:53,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:53,990 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:54,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-16 12:18:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:54,207 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1637062738, now seen corresponding path program 1 times [2022-11-16 12:18:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:18:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336269052] [2022-11-16 12:18:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:18:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:18:54,210 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:18:54,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 12:18:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:54,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:18:54,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-16 12:18:58,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:01,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:19:01,959 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 30 treesize of output 29 [2022-11-16 12:19:01,992 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:19:01,992 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 19 [2022-11-16 12:19:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-16 12:19:02,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:19:02,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336269052] [2022-11-16 12:19:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336269052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:19:02,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:19:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2022-11-16 12:19:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476976075] [2022-11-16 12:19:02,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:02,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:19:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:19:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:19:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:19:02,034 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 12:19:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:04,514 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2022-11-16 12:19:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:19:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 111 [2022-11-16 12:19:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:04,518 INFO L225 Difference]: With dead ends: 380 [2022-11-16 12:19:04,518 INFO L226 Difference]: Without dead ends: 282 [2022-11-16 12:19:04,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 192 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:19:04,520 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:04,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1118 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 351 Invalid, 0 Unknown, 135 Unchecked, 1.2s Time] [2022-11-16 12:19:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-16 12:19:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 271. [2022-11-16 12:19:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 203 states have (on average 1.1822660098522169) internal successors, (240), 206 states have internal predecessors, (240), 40 states have call successors, (40), 25 states have call predecessors, (40), 27 states have return successors, (54), 39 states have call predecessors, (54), 39 states have call successors, (54) [2022-11-16 12:19:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2022-11-16 12:19:04,587 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 111 [2022-11-16 12:19:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:04,588 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2022-11-16 12:19:04,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 12:19:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2022-11-16 12:19:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:19:04,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:04,590 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:04,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:04,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:19:04,807 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1895228176, now seen corresponding path program 1 times [2022-11-16 12:19:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:19:04,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471633993] [2022-11-16 12:19:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:04,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:19:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:19:04,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:19:04,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 12:19:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:05,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 12:19:05,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:07,298 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) is different from true [2022-11-16 12:19:09,457 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|))))) is different from true [2022-11-16 12:19:11,688 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_30) v_aws_linked_list_front_~list.offset_BEFORE_CALL_31) (_ bv0 64)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_30) v_aws_linked_list_front_~list.offset_BEFORE_CALL_31))))) is different from true [2022-11-16 12:19:13,837 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_31 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_31) v_aws_linked_list_front_~list.offset_BEFORE_CALL_32)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_31 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_31) v_aws_linked_list_front_~list.offset_BEFORE_CALL_32))))) is different from true [2022-11-16 12:19:15,996 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_32) v_aws_linked_list_front_~list.offset_BEFORE_CALL_33)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_33 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_32) v_aws_linked_list_front_~list.offset_BEFORE_CALL_33) (_ bv0 64))))) is different from true [2022-11-16 12:19:18,112 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_33) v_aws_linked_list_front_~list.offset_BEFORE_CALL_34)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_33) v_aws_linked_list_front_~list.offset_BEFORE_CALL_34) (_ bv0 64))))) is different from true [2022-11-16 12:19:26,292 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:19:40,990 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:19:47,186 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:19:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 19 not checked. [2022-11-16 12:19:47,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:50,375 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:19:50,376 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-11-16 12:19:50,393 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 12:19:50,393 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 20 treesize of output 12 [2022-11-16 12:19:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-16 12:19:50,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:19:50,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471633993] [2022-11-16 12:19:50,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471633993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:19:50,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:19:50,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2022-11-16 12:19:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546716491] [2022-11-16 12:19:50,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:50,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:19:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:19:50,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:19:50,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=221, Unknown=10, NotChecked=210, Total=506 [2022-11-16 12:19:50,426 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-16 12:20:07,419 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))))) is different from true [2022-11-16 12:20:21,707 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:20:31,883 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:20:40,086 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:20:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:40,312 INFO L93 Difference]: Finished difference Result 455 states and 552 transitions. [2022-11-16 12:20:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:20:40,314 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 111 [2022-11-16 12:20:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:40,316 INFO L225 Difference]: With dead ends: 455 [2022-11-16 12:20:40,317 INFO L226 Difference]: Without dead ends: 349 [2022-11-16 12:20:40,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 93.1s TimeCoverageRelationStatistics Valid=164, Invalid=489, Unknown=25, NotChecked=378, Total=1056 [2022-11-16 12:20:40,318 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 173 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:40,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 711 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 1059 Unchecked, 0.6s Time] [2022-11-16 12:20:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-16 12:20:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 305. [2022-11-16 12:20:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 231 states have (on average 1.173160173160173) internal successors, (271), 236 states have internal predecessors, (271), 40 states have call successors, (40), 29 states have call predecessors, (40), 33 states have return successors, (56), 39 states have call predecessors, (56), 39 states have call successors, (56) [2022-11-16 12:20:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 367 transitions. [2022-11-16 12:20:40,364 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 367 transitions. Word has length 111 [2022-11-16 12:20:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:40,365 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 367 transitions. [2022-11-16 12:20:40,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 22 states have internal predecessors, (92), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-16 12:20:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 367 transitions. [2022-11-16 12:20:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:20:40,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:40,367 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:40,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:40,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:20:40,569 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:20:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 884110926, now seen corresponding path program 1 times [2022-11-16 12:20:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:20:40,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234094221] [2022-11-16 12:20:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:20:40,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:20:40,572 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:20:40,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 12:20:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:40,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:20:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-16 12:20:40,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:20:40,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:20:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234094221] [2022-11-16 12:20:40,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234094221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:40,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:20:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766217236] [2022-11-16 12:20:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:40,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:20:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:20:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:20:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:40,957 INFO L87 Difference]: Start difference. First operand 305 states and 367 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:20:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:41,149 INFO L93 Difference]: Finished difference Result 605 states and 744 transitions. [2022-11-16 12:20:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:20:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2022-11-16 12:20:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:41,152 INFO L225 Difference]: With dead ends: 605 [2022-11-16 12:20:41,153 INFO L226 Difference]: Without dead ends: 292 [2022-11-16 12:20:41,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:20:41,154 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:41,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 539 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-16 12:20:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-16 12:20:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 219 states have (on average 1.1461187214611872) internal successors, (251), 223 states have internal predecessors, (251), 40 states have call successors, (40), 29 states have call predecessors, (40), 32 states have return successors, (53), 39 states have call predecessors, (53), 39 states have call successors, (53) [2022-11-16 12:20:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2022-11-16 12:20:41,204 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 111 [2022-11-16 12:20:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:41,205 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2022-11-16 12:20:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 12:20:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2022-11-16 12:20:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-16 12:20:41,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:41,209 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:41,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:41,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:20:41,434 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:20:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1573375158, now seen corresponding path program 1 times [2022-11-16 12:20:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:20:41,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784401255] [2022-11-16 12:20:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:20:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:20:41,437 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:20:41,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-16 12:20:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:41,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:20:41,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:41,981 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-16 12:20:41,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-16 12:20:41,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 12:20:42,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 12:20:42,120 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-16 12:20:42,120 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 36 [2022-11-16 12:20:42,128 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 29 treesize of output 17 [2022-11-16 12:20:42,469 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) is different from true [2022-11-16 12:20:45,858 WARN L855 $PredicateComparison]: unable to prove that (and (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse2) (not (= (_ bv0 64) .cse2))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse3)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_front_~list.base) (_ bv24 64)))) (let ((.cse5 (not (= (_ bv0 64) .cse4)))) (or (and (= c_aws_linked_list_front_~list.base .cse4) .cse5) (and .cse5 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse4 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse4)))))))) is different from true [2022-11-16 12:20:52,575 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse1)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse1))) (not (= (_ bv0 64) .cse1)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= .cse2 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse3)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse4) (not (= (_ bv0 64) .cse4))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse6 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (= .cse6 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse7 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse7))))))) is different from true [2022-11-16 12:21:09,171 WARN L233 SmtUtils]: Spent 10.32s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:21:14,369 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse2)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse3))) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= .cse4 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse6) (not (= (_ bv0 64) .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse7)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse9 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse10) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse10)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse10)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse11)) (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:15,017 WARN L855 $PredicateComparison]: unable to prove that (and (= (_ bv0 64) c_aws_linked_list_front_~list.offset) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse2)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse3) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse3)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse3))) (not (= (_ bv0 64) .cse3)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= .cse4 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse6) (not (= (_ bv0 64) .cse6))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse7)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse8)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse9 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse9)))))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_aws_linked_list_front_~list.base) (_ bv24 64)))) (let ((.cse11 (not (= (_ bv0 64) .cse10)))) (or (and (= c_aws_linked_list_front_~list.base .cse10) .cse11) (and .cse11 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) c_aws_linked_list_front_~list.base v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse10))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:15,377 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse2 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (not (= .cse3 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse11)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:15,620 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse2 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (not (= .cse3 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse9)))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse11)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:53,605 WARN L233 SmtUtils]: Spent 35.33s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:21:53,831 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse2 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (not (= .cse3 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse9)))))) (or |c_aws_linked_list_is_valid_#t~short303#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse11)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:54,103 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse0 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_46 v_DerPreprocessor_2) .cse0)))) (not (= .cse0 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_46 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (_ bv24 64)))) (and (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_46) (not (= .cse1 (_ bv0 64))))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= .cse2 (select v_DerPreprocessor_2 (_ bv24 64))) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_48 v_DerPreprocessor_2) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 (_ bv0 64)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_48 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (_ bv24 64)))) (and (= .cse3 v_aws_linked_list_front_~list.base_BEFORE_CALL_48) (not (= .cse3 (_ bv0 64))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| .cse4)))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| (_ BitVec 64))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_32| v_DerPreprocessor_2) .cse5)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse5))) (not (= (_ bv0 64) .cse5)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse6)) (= .cse6 v_aws_linked_list_front_~list.base_BEFORE_CALL_44)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_44 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_44) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse7)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_44 v_DerPreprocessor_2) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 (select v_DerPreprocessor_2 (_ bv24 64))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd |c_aws_linked_list_is_valid_#in~list#1.offset| (_ bv24 64))) (_ bv0 64)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (= |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| .cse8) (not (= (_ bv0 64) .cse8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| (_ BitVec 64))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33|) (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_2) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (= .cse9 (select v_DerPreprocessor_2 (_ bv24 64))))) (not (= (_ bv0 64) .cse9)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse10)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_45 v_DerPreprocessor_2) .cse10) (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 (select v_DerPreprocessor_2 (_ bv24 64)))))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_45 (_ BitVec 64))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (_ bv24 64)))) (and (= .cse11 v_aws_linked_list_front_~list.base_BEFORE_CALL_45) (not (= (_ bv0 64) .cse11)))))) (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse12)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (and (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12 v_DerPreprocessor_1) v_aws_linked_list_front_~list.base_BEFORE_CALL_47 v_DerPreprocessor_2) .cse12)) (= (select v_DerPreprocessor_2 (_ bv24 64)) .cse12)))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_47 (_ BitVec 64))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_47) (_ bv24 64)))) (and (not (= (_ bv0 64) .cse13)) (= .cse13 v_aws_linked_list_front_~list.base_BEFORE_CALL_47)))))) is different from true [2022-11-16 12:21:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 51 not checked. [2022-11-16 12:21:54,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:57,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:21:57,284 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 124 treesize of output 127 [2022-11-16 12:21:57,294 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 136 treesize of output 128 [2022-11-16 12:21:57,301 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 128 treesize of output 124 [2022-11-16 12:21:57,403 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 22 treesize of output 18 [2022-11-16 12:21:57,425 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 8 treesize of output 4 [2022-11-16 12:21:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-16 12:21:57,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:21:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784401255] [2022-11-16 12:21:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784401255] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:57,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:21:57,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [24] total 33 [2022-11-16 12:21:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183802237] [2022-11-16 12:21:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:21:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:21:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:21:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=82, NotChecked=468, Total=1056 [2022-11-16 12:21:57,783 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:22:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:01,511 INFO L93 Difference]: Finished difference Result 414 states and 505 transitions. [2022-11-16 12:22:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:22:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2022-11-16 12:22:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:01,514 INFO L225 Difference]: With dead ends: 414 [2022-11-16 12:22:01,514 INFO L226 Difference]: Without dead ends: 315 [2022-11-16 12:22:01,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=90, NotChecked=540, Total=1332 [2022-11-16 12:22:01,516 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:01,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 944 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 12:22:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-16 12:22:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 306. [2022-11-16 12:22:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 225 states have (on average 1.1422222222222222) internal successors, (257), 230 states have internal predecessors, (257), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (62), 46 states have call predecessors, (62), 45 states have call successors, (62) [2022-11-16 12:22:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2022-11-16 12:22:01,580 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 113 [2022-11-16 12:22:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:01,580 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2022-11-16 12:22:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 12:22:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2022-11-16 12:22:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 12:22:01,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:01,583 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:01,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-16 12:22:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:22:01,798 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1350560461, now seen corresponding path program 1 times [2022-11-16 12:22:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:22:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882813886] [2022-11-16 12:22:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:22:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:22:01,800 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:22:01,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 12:22:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:02,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 12:22:02,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 72 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:22:33,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:01,221 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-16 12:23:01,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 125 [2022-11-16 12:23:01,924 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-16 12:23:01,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 132 [2022-11-16 12:23:10,265 INFO L321 Elim1Store]: treesize reduction 17, result has 82.8 percent of original size [2022-11-16 12:23:10,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 125 [2022-11-16 12:23:11,056 INFO L321 Elim1Store]: treesize reduction 8, result has 88.1 percent of original size [2022-11-16 12:23:11,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 132 [2022-11-16 12:23:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 12:23:13,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:23:13,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882813886] [2022-11-16 12:23:13,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882813886] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:13,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:23:13,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 38 [2022-11-16 12:23:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366574068] [2022-11-16 12:23:13,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:13,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 12:23:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:23:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 12:23:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1262, Unknown=6, NotChecked=0, Total=1406 [2022-11-16 12:23:13,840 INFO L87 Difference]: Start difference. First operand 306 states and 365 transitions. Second operand has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) [2022-11-16 12:23:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:25,818 INFO L93 Difference]: Finished difference Result 507 states and 623 transitions. [2022-11-16 12:23:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 12:23:25,821 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) Word has length 124 [2022-11-16 12:23:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:25,823 INFO L225 Difference]: With dead ends: 507 [2022-11-16 12:23:25,824 INFO L226 Difference]: Without dead ends: 379 [2022-11-16 12:23:25,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=286, Invalid=2462, Unknown=8, NotChecked=0, Total=2756 [2022-11-16 12:23:25,826 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:25,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2433 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 444 Unchecked, 2.5s Time] [2022-11-16 12:23:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-16 12:23:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 324. [2022-11-16 12:23:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 239 states have (on average 1.1255230125523012) internal successors, (269), 245 states have internal predecessors, (269), 48 states have call successors, (48), 30 states have call predecessors, (48), 36 states have return successors, (62), 48 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-16 12:23:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 379 transitions. [2022-11-16 12:23:25,916 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 379 transitions. Word has length 124 [2022-11-16 12:23:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:25,917 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 379 transitions. [2022-11-16 12:23:25,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 32 states have internal predecessors, (128), 12 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (26), 13 states have call predecessors, (26), 11 states have call successors, (26) [2022-11-16 12:23:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 379 transitions. [2022-11-16 12:23:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 12:23:25,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:25,919 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:25,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:26,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:23:26,134 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:23:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1092395023, now seen corresponding path program 1 times [2022-11-16 12:23:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:23:26,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132220559] [2022-11-16 12:23:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:26,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:23:26,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:23:26,137 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:23:26,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-16 12:23:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:26,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:23:26,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:28,791 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|))))) is different from true [2022-11-16 12:23:30,952 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) is different from true [2022-11-16 12:23:33,172 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_60 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_63) v_aws_linked_list_front_~list.offset_BEFORE_CALL_60)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_60 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_63) v_aws_linked_list_front_~list.offset_BEFORE_CALL_60))))) is different from true [2022-11-16 12:23:35,319 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_61 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_64 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_64) v_aws_linked_list_front_~list.offset_BEFORE_CALL_61) (_ bv0 64)))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_61 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_64 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_64) v_aws_linked_list_front_~list.offset_BEFORE_CALL_61))))) is different from true [2022-11-16 12:23:37,498 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_65) v_aws_linked_list_front_~list.offset_BEFORE_CALL_62)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_65 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_62 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_65) v_aws_linked_list_front_~list.offset_BEFORE_CALL_62))))) is different from true [2022-11-16 12:23:39,637 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_66) v_aws_linked_list_front_~list.offset_BEFORE_CALL_63)))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_66 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_63 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_66) v_aws_linked_list_front_~list.offset_BEFORE_CALL_63) (_ bv0 64))))) is different from true [2022-11-16 12:23:47,819 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:23:54,184 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:00,430 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:06,712 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:13,028 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:19,308 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:25,513 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:31,855 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 43 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 33 not checked. [2022-11-16 12:24:31,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:24:37,433 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:24:37,433 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-11-16 12:24:37,468 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 12:24:37,469 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 20 treesize of output 12 [2022-11-16 12:24:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-16 12:24:37,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:24:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132220559] [2022-11-16 12:24:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132220559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:24:37,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:24:37,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 31 [2022-11-16 12:24:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018052712] [2022-11-16 12:24:37,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:24:37,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 12:24:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:24:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 12:24:37,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=531, Unknown=8, NotChecked=306, Total=930 [2022-11-16 12:24:37,510 INFO L87 Difference]: Start difference. First operand 324 states and 379 transitions. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-16 12:25:02,296 WARN L233 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 43 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:04,569 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_25|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_25|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|)))))) is different from true [2022-11-16 12:25:15,260 WARN L233 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 50 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:27,718 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 41 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:39,376 WARN L233 SmtUtils]: Spent 11.42s on a formula simplification. DAG size of input: 41 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:51,578 INFO L93 Difference]: Finished difference Result 502 states and 600 transitions. [2022-11-16 12:25:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:25:51,579 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 124 [2022-11-16 12:25:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:51,582 INFO L225 Difference]: With dead ends: 502 [2022-11-16 12:25:51,582 INFO L226 Difference]: Without dead ends: 367 [2022-11-16 12:25:51,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 212 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 140.2s TimeCoverageRelationStatistics Valid=216, Invalid=1199, Unknown=19, NotChecked=546, Total=1980 [2022-11-16 12:25:51,584 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1284 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:51,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1207 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 456 Invalid, 0 Unknown, 1284 Unchecked, 2.0s Time] [2022-11-16 12:25:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-16 12:25:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2022-11-16 12:25:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 247 states have (on average 1.1133603238866396) internal successors, (275), 255 states have internal predecessors, (275), 48 states have call successors, (48), 30 states have call predecessors, (48), 38 states have return successors, (62), 48 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-16 12:25:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 385 transitions. [2022-11-16 12:25:51,648 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 385 transitions. Word has length 124 [2022-11-16 12:25:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:51,648 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 385 transitions. [2022-11-16 12:25:51,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 30 states have internal predecessors, (114), 7 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-16 12:25:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 385 transitions. [2022-11-16 12:25:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 12:25:51,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:51,650 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:51,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-16 12:25:51,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:25:51,869 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:25:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2103512273, now seen corresponding path program 1 times [2022-11-16 12:25:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:25:51,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406008870] [2022-11-16 12:25:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:25:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:25:51,872 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:25:51,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-16 12:25:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:52,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:25:52,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:25:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-16 12:25:52,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:25:52,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:25:52,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406008870] [2022-11-16 12:25:52,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406008870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:52,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:52,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:25:52,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98690852] [2022-11-16 12:25:52,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:52,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:25:52,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:25:52,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:25:52,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:25:52,487 INFO L87 Difference]: Start difference. First operand 334 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-16 12:25:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:53,198 INFO L93 Difference]: Finished difference Result 660 states and 784 transitions. [2022-11-16 12:25:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:25:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2022-11-16 12:25:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:53,201 INFO L225 Difference]: With dead ends: 660 [2022-11-16 12:25:53,202 INFO L226 Difference]: Without dead ends: 334 [2022-11-16 12:25:53,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:25:53,204 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:53,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 849 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:25:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-16 12:25:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 291. [2022-11-16 12:25:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 211 states have (on average 1.09478672985782) internal successors, (231), 216 states have internal predecessors, (231), 47 states have call successors, (47), 28 states have call predecessors, (47), 32 states have return successors, (55), 46 states have call predecessors, (55), 46 states have call successors, (55) [2022-11-16 12:25:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2022-11-16 12:25:53,263 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 124 [2022-11-16 12:25:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:53,263 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2022-11-16 12:25:53,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-16 12:25:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2022-11-16 12:25:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 12:25:53,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:53,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:53,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-16 12:25:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:25:53,484 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:25:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -945612142, now seen corresponding path program 1 times [2022-11-16 12:25:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:25:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778125704] [2022-11-16 12:25:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:25:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:25:53,486 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:25:53,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-16 12:25:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:53,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 12:25:53,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 80 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 12:26:02,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:26:19,939 INFO L321 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-16 12:26:19,939 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2022-11-16 12:26:24,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:26:24,845 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 33 treesize of output 36 [2022-11-16 12:26:25,931 INFO L321 Elim1Store]: treesize reduction 4, result has 92.9 percent of original size [2022-11-16 12:26:25,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 68 [2022-11-16 12:26:26,215 INFO L321 Elim1Store]: treesize reduction 4, result has 92.9 percent of original size [2022-11-16 12:26:26,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 68 [2022-11-16 12:26:26,311 INFO L321 Elim1Store]: treesize reduction 19, result has 38.7 percent of original size [2022-11-16 12:26:26,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 28 [2022-11-16 12:26:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 19 proven. 43 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-16 12:26:27,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778125704] [2022-11-16 12:26:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778125704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:26:27,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:26:27,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2022-11-16 12:26:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043299761] [2022-11-16 12:26:27,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:26:27,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 12:26:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 12:26:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1420, Unknown=4, NotChecked=0, Total=1560 [2022-11-16 12:26:27,073 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-16 12:27:00,510 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_node_next_is_valid_#in~node.base| c_aws_linked_list_node_next_is_valid_~node.base) (= c_aws_linked_list_node_next_is_valid_~node.offset |c_aws_linked_list_node_next_is_valid_#in~node.offset|) (or |c_aws_linked_list_node_next_is_valid_#t~short309| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|) (_ bv0 64)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34| (_ BitVec 64))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34|)) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_35|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_34|)))))) is different from false [2022-11-16 12:27:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:14,676 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2022-11-16 12:27:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 12:27:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) Word has length 137 [2022-11-16 12:27:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:14,680 INFO L225 Difference]: With dead ends: 700 [2022-11-16 12:27:14,680 INFO L226 Difference]: Without dead ends: 577 [2022-11-16 12:27:14,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 233 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 72.3s TimeCoverageRelationStatistics Valid=350, Invalid=3301, Unknown=13, NotChecked=118, Total=3782 [2022-11-16 12:27:14,682 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 331 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 3144 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1307 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:14,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 3144 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1015 Invalid, 0 Unknown, 1307 Unchecked, 4.1s Time] [2022-11-16 12:27:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-11-16 12:27:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 443. [2022-11-16 12:27:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 327 states have (on average 1.0978593272171253) internal successors, (359), 336 states have internal predecessors, (359), 65 states have call successors, (65), 42 states have call predecessors, (65), 50 states have return successors, (85), 64 states have call predecessors, (85), 64 states have call successors, (85) [2022-11-16 12:27:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 509 transitions. [2022-11-16 12:27:14,830 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 509 transitions. Word has length 137 [2022-11-16 12:27:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:14,830 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 509 transitions. [2022-11-16 12:27:14,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 38 states have internal predecessors, (138), 15 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-16 12:27:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 509 transitions. [2022-11-16 12:27:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:27:14,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:14,836 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:14,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:15,056 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 726269746, now seen corresponding path program 2 times [2022-11-16 12:27:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:15,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076238091] [2022-11-16 12:27:15,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:15,058 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:15,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8fbe959-097c-4fb8-8dfa-3e1f846be615/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-16 12:27:15,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:27:15,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:15,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 12:27:15,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:19,116 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_78 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_87 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78)) (.cse0 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse0)) (.cse2 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse3) .cse0) (_ bv8 64)))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= .cse1 v_aws_linked_list_front_~list.base_BEFORE_CALL_87) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) .cse3))))) is different from true [2022-11-16 12:27:25,656 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_79 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_88 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_88) v_aws_linked_list_front_~list.offset_BEFORE_CALL_79)) (.cse2 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_88) v_aws_linked_list_front_~list.offset_BEFORE_CALL_79))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2)))) (and (= .cse0 v_aws_linked_list_front_~list.base_BEFORE_CALL_88) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3))))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_78 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_87 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78)) (.cse4 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) .cse4)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse7) .cse4) (_ bv8 64)))) (and (= .cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) (= .cse5 v_aws_linked_list_front_~list.base_BEFORE_CALL_87) (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) .cse7)))))) is different from true [2022-11-16 12:27:30,450 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_89 (_ BitVec 64)) (v_aws_linked_list_front_~list.offset_BEFORE_CALL_80 (_ BitVec 64))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_89) v_aws_linked_list_front_~list.offset_BEFORE_CALL_80)) (.cse3 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_89) v_aws_linked_list_front_~list.offset_BEFORE_CALL_80))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (bvadd (_ bv8 64) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3)))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse0 v_aws_linked_list_front_~list.base_BEFORE_CALL_89) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse3))))) (exists ((v_aws_linked_list_front_~list.offset_BEFORE_CALL_78 (_ BitVec 64)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_87 (_ BitVec 64))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78)) (.cse4 (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_87) v_aws_linked_list_front_~list.offset_BEFORE_CALL_78))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse7) .cse4)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| .cse7) .cse4) (_ bv8 64)))) (and (= .cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) (= .cse5 v_aws_linked_list_front_~list.base_BEFORE_CALL_87) (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) .cse7)))))) is different from true