./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b1945af2ade54d1624a03901c69c53701706acb2f9d45d13f3de2c91731e4958 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:36:29,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:36:29,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:36:29,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:36:29,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:36:29,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:36:29,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:36:29,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:36:30,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:36:30,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:36:30,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:36:30,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:36:30,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:36:30,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:36:30,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:36:30,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:36:30,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:36:30,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:36:30,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:36:30,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:36:30,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:36:30,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:36:30,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:36:30,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:36:30,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:36:30,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:36:30,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:36:30,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:36:30,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:36:30,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:36:30,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:36:30,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:36:30,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:36:30,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:36:30,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:36:30,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:36:30,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:36:30,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:36:30,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:36:30,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:36:30,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:36:30,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 17:36:30,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:36:30,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:36:30,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:36:30,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:36:30,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:36:30,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:36:30,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:36:30,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:36:30,063 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:36:30,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:36:30,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:36:30,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:36:30,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:36:30,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:36:30,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:36:30,065 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1945af2ade54d1624a03901c69c53701706acb2f9d45d13f3de2c91731e4958 [2022-12-13 17:36:30,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:36:30,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:36:30,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:36:30,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:36:30,274 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:36:30,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2022-12-13 17:36:32,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:36:33,172 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:36:33,173 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2022-12-13 17:36:33,193 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/data/6f7b1c627/03408898ab854bd5b0e3310f702666a5/FLAG760710ded [2022-12-13 17:36:33,206 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/data/6f7b1c627/03408898ab854bd5b0e3310f702666a5 [2022-12-13 17:36:33,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:36:33,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:36:33,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:36:33,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:36:33,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:36:33,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:33" (1/1) ... [2022-12-13 17:36:33,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fed04b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:33, skipping insertion in model container [2022-12-13 17:36:33,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:33" (1/1) ... [2022-12-13 17:36:33,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:36:33,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:36:33,515 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2022-12-13 17:36:33,520 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2022-12-13 17:36:34,014 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:36:34,019 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,019 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,019 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,020 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,021 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,030 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,031 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,032 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,033 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,034 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,035 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,035 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,036 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,079 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,080 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,080 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,083 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 17:36:34,085 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 17:36:34,085 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 17:36:34,270 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 17:36:34,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 17:36:34,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 17:36:34,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 17:36:34,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 17:36:34,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 17:36:34,274 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 17:36:34,274 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 17:36:34,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 17:36:34,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 17:36:34,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 17:36:34,373 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 17:36:34,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:36:34,400 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:36:34,410 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2022-12-13 17:36:34,410 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2022-12-13 17:36:34,434 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:36:34,436 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,437 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,437 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,437 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,438 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,443 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,444 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,445 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,445 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,446 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,446 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,447 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,447 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:36:34,452 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,452 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,453 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:36:34,455 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 17:36:34,456 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 17:36:34,457 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 17:36:34,474 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 17:36:34,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 17:36:34,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 17:36:34,476 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 17:36:34,476 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 17:36:34,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 17:36:34,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 17:36:34,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 17:36:34,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 17:36:34,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 17:36:34,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 17:36:34,494 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 17:36:34,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:36:34,647 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:36:34,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34 WrapperNode [2022-12-13 17:36:34,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:36:34,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:36:34,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:36:34,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:36:34,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,739 INFO L138 Inliner]: procedures = 679, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2022-12-13 17:36:34,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:36:34,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:36:34,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:36:34,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:36:34,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:36:34,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:36:34,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:36:34,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:36:34,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (1/1) ... [2022-12-13 17:36:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:36:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:34,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:36:34,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:36:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:36:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 17:36:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-12-13 17:36:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-12-13 17:36:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 17:36:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:36:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 17:36:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 17:36:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 17:36:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:36:35,022 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:36:35,023 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:36:35,204 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:36:35,210 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:36:35,210 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 17:36:35,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:35 BoogieIcfgContainer [2022-12-13 17:36:35,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:36:35,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:36:35,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:36:35,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:36:35,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:36:33" (1/3) ... [2022-12-13 17:36:35,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635b0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:35, skipping insertion in model container [2022-12-13 17:36:35,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:34" (2/3) ... [2022-12-13 17:36:35,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635b0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:35, skipping insertion in model container [2022-12-13 17:36:35,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:35" (3/3) ... [2022-12-13 17:36:35,220 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2022-12-13 17:36:35,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:36:35,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:36:35,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:36:35,278 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;@214aeb17, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:36:35,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:36:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 17:36:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:36:35,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:35,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:35,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2022-12-13 17:36:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:35,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962623511] [2022-12-13 17:36:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 17:36:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:36:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 17:36:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:36:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 17:36:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962623511] [2022-12-13 17:36:35,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962623511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:35,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:36:35,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:36:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702619718] [2022-12-13 17:36:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:35,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 17:36:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 17:36:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:36:35,759 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:35,788 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2022-12-13 17:36:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 17:36:35,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-12-13 17:36:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:35,797 INFO L225 Difference]: With dead ends: 130 [2022-12-13 17:36:35,797 INFO L226 Difference]: Without dead ends: 64 [2022-12-13 17:36:35,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:36:35,802 INFO L413 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:35,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-13 17:36:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-12-13 17:36:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-13 17:36:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-12-13 17:36:35,832 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2022-12-13 17:36:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:35,833 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-12-13 17:36:35,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-12-13 17:36:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 17:36:35,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:35,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:35,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:36:35,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2022-12-13 17:36:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:35,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219678727] [2022-12-13 17:36:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 17:36:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:36:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 17:36:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:36:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:36:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219678727] [2022-12-13 17:36:36,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219678727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448096054] [2022-12-13 17:36:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:36,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:36,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:36,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:36:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:36:36,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:36:36,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:36,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448096054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:36,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:36,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-13 17:36:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536089925] [2022-12-13 17:36:36,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:36:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:36:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:36:36,493 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:36:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:36,551 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2022-12-13 17:36:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:36:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-12-13 17:36:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:36,553 INFO L225 Difference]: With dead ends: 116 [2022-12-13 17:36:36,554 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 17:36:36,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:36:36,555 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:36,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 375 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 17:36:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-13 17:36:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-12-13 17:36:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2022-12-13 17:36:36,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2022-12-13 17:36:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:36,564 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2022-12-13 17:36:36,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:36:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2022-12-13 17:36:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 17:36:36,567 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:36,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:36,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:36:36,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:36,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2022-12-13 17:36:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961824232] [2022-12-13 17:36:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:36:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 17:36:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 17:36:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:36:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:36:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:36,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961824232] [2022-12-13 17:36:36,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961824232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:36,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338620602] [2022-12-13 17:36:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:36,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:36,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:36,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:36,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:36:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:36:37,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:36:37,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338620602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:37,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:37,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-12-13 17:36:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209042231] [2022-12-13 17:36:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:37,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:36:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:36:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:36:37,186 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:37,333 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2022-12-13 17:36:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:36:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-12-13 17:36:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:37,334 INFO L225 Difference]: With dead ends: 121 [2022-12-13 17:36:37,335 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 17:36:37,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:36:37,336 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:37,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 245 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:36:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 17:36:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 17:36:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-12-13 17:36:37,348 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2022-12-13 17:36:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:37,348 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-12-13 17:36:37,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-12-13 17:36:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 17:36:37,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:37,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:37,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:36:37,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:37,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2022-12-13 17:36:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395323453] [2022-12-13 17:36:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 17:36:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 17:36:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 17:36:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:36:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395323453] [2022-12-13 17:36:37,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395323453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696225324] [2022-12-13 17:36:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:37,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:37,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:37,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:36:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:37,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:36:37,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 17:36:37,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:37,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696225324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:37,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:37,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-12-13 17:36:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370983570] [2022-12-13 17:36:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:37,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:36:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:36:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:36:37,980 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:38,171 INFO L93 Difference]: Finished difference Result 136 states and 187 transitions. [2022-12-13 17:36:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:36:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-12-13 17:36:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:38,173 INFO L225 Difference]: With dead ends: 136 [2022-12-13 17:36:38,173 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 17:36:38,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:36:38,175 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 145 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:38,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 287 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:36:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 17:36:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-12-13 17:36:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-12-13 17:36:38,186 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2022-12-13 17:36:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:38,186 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-12-13 17:36:38,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-12-13 17:36:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 17:36:38,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:38,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:38,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 17:36:38,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:38,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:38,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2022-12-13 17:36:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:38,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625391584] [2022-12-13 17:36:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 17:36:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:36:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 17:36:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 17:36:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 17:36:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625391584] [2022-12-13 17:36:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625391584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937349931] [2022-12-13 17:36:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:38,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:38,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:36:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:38,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:36:38,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:36:38,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:38,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937349931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:38,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:38,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 17:36:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781526152] [2022-12-13 17:36:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:38,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:36:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:36:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:36:38,795 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:38,814 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2022-12-13 17:36:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:36:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-12-13 17:36:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:38,815 INFO L225 Difference]: With dead ends: 137 [2022-12-13 17:36:38,816 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 17:36:38,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:36:38,817 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:38,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 162 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 17:36:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2022-12-13 17:36:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-12-13 17:36:38,829 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2022-12-13 17:36:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:38,829 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-12-13 17:36:38,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 17:36:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-12-13 17:36:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-13 17:36:38,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:38,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:38,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:36:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:39,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2022-12-13 17:36:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:39,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578547671] [2022-12-13 17:36:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 17:36:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:36:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 17:36:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:36:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:36:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:39,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578547671] [2022-12-13 17:36:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578547671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754197588] [2022-12-13 17:36:39,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:39,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:39,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:36:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 17:36:39,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:36:39,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:39,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754197588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:39,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:39,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-13 17:36:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252338717] [2022-12-13 17:36:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:39,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:36:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:36:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:36:39,495 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:39,548 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2022-12-13 17:36:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:36:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2022-12-13 17:36:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:39,550 INFO L225 Difference]: With dead ends: 136 [2022-12-13 17:36:39,550 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 17:36:39,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:36:39,552 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:39,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 463 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 17:36:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-12-13 17:36:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-12-13 17:36:39,562 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2022-12-13 17:36:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:39,562 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-12-13 17:36:39,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-12-13 17:36:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 17:36:39,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:39,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:39,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:36:39,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:39,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2022-12-13 17:36:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:39,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975549483] [2022-12-13 17:36:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 17:36:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 17:36:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 17:36:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 17:36:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 17:36:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975549483] [2022-12-13 17:36:40,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975549483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504753773] [2022-12-13 17:36:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:40,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:40,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:36:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 17:36:40,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 17:36:40,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:40,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504753773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:40,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:40,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-12-13 17:36:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204095326] [2022-12-13 17:36:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:40,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:36:40,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:36:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:36:40,338 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:40,427 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2022-12-13 17:36:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:36:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2022-12-13 17:36:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:40,429 INFO L225 Difference]: With dead ends: 141 [2022-12-13 17:36:40,429 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 17:36:40,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:36:40,430 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:40,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 545 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 17:36:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-12-13 17:36:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-12-13 17:36:40,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 83 [2022-12-13 17:36:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:40,437 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-12-13 17:36:40,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-12-13 17:36:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 17:36:40,438 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:40,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:40,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:36:40,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:40,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -233275002, now seen corresponding path program 1 times [2022-12-13 17:36:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228612654] [2022-12-13 17:36:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 17:36:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 17:36:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 17:36:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228612654] [2022-12-13 17:36:40,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228612654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384268806] [2022-12-13 17:36:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:40,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:40,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:40,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:36:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:36:41,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 17:36:41,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:41,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384268806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:41,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:41,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-13 17:36:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103625873] [2022-12-13 17:36:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:41,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:36:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:41,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:36:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:36:41,111 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:41,143 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2022-12-13 17:36:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:36:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-12-13 17:36:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:41,144 INFO L225 Difference]: With dead ends: 129 [2022-12-13 17:36:41,144 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 17:36:41,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:36:41,145 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:41,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 376 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 17:36:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 17:36:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 58 states have internal predecessors, (68), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2022-12-13 17:36:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-12-13 17:36:41,150 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 84 [2022-12-13 17:36:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:41,151 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-12-13 17:36:41,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-12-13 17:36:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 17:36:41,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:41,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:41,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 17:36:41,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:41,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash 788375522, now seen corresponding path program 1 times [2022-12-13 17:36:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500060353] [2022-12-13 17:36:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 17:36:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 17:36:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 17:36:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:41,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500060353] [2022-12-13 17:36:41,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500060353] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607409350] [2022-12-13 17:36:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:41,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:41,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:41,547 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:41,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:36:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:41,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:36:41,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:36:41,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607409350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:41,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-12-13 17:36:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599450641] [2022-12-13 17:36:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:36:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:36:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:36:41,778 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:41,930 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2022-12-13 17:36:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:36:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2022-12-13 17:36:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:41,932 INFO L225 Difference]: With dead ends: 138 [2022-12-13 17:36:41,932 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 17:36:41,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:36:41,933 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:41,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 286 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:36:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 17:36:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 17:36:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 58 states have internal predecessors, (67), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (19), 12 states have call predecessors, (19), 12 states have call successors, (19) [2022-12-13 17:36:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-12-13 17:36:41,944 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 86 [2022-12-13 17:36:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:41,945 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-12-13 17:36:41,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-12-13 17:36:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 17:36:41,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:41,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:41,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 17:36:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:42,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:42,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1039859473, now seen corresponding path program 1 times [2022-12-13 17:36:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:42,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11818313] [2022-12-13 17:36:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 17:36:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 17:36:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 17:36:42,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:42,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11818313] [2022-12-13 17:36:42,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11818313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:42,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954806548] [2022-12-13 17:36:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:42,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:42,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:42,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:42,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:36:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:42,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 17:36:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 17:36:42,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954806548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:42,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:42,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-12-13 17:36:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076847724] [2022-12-13 17:36:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:42,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:36:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:36:42,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:36:42,668 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:42,851 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2022-12-13 17:36:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:36:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2022-12-13 17:36:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:42,853 INFO L225 Difference]: With dead ends: 140 [2022-12-13 17:36:42,853 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 17:36:42,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-12-13 17:36:42,854 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 140 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:42,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 319 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:36:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 17:36:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-12-13 17:36:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 54 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2022-12-13 17:36:42,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 88 [2022-12-13 17:36:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:42,862 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2022-12-13 17:36:42,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 17:36:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2022-12-13 17:36:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 17:36:42,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:42,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:42,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 17:36:43,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 17:36:43,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2465506, now seen corresponding path program 1 times [2022-12-13 17:36:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:43,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917246867] [2022-12-13 17:36:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 17:36:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:36:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-13 17:36:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:43,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917246867] [2022-12-13 17:36:43,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917246867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:43,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478897835] [2022-12-13 17:36:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:43,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:43,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:43,334 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:43,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:36:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:43,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 17:36:43,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:36:43,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:43,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478897835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:43,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:43,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-13 17:36:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253693191] [2022-12-13 17:36:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:43,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:36:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:36:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:36:43,504 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:43,553 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-12-13 17:36:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:36:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 97 [2022-12-13 17:36:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:43,555 INFO L225 Difference]: With dead ends: 126 [2022-12-13 17:36:43,555 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 17:36:43,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:36:43,556 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:43,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 17:36:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-12-13 17:36:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 55 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-13 17:36:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2022-12-13 17:36:43,562 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 97 [2022-12-13 17:36:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:43,562 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2022-12-13 17:36:43,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 17:36:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-12-13 17:36:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 17:36:43,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:43,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:36:43,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 17:36:43,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 17:36:43,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -385140753, now seen corresponding path program 2 times [2022-12-13 17:36:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723151487] [2022-12-13 17:36:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:36:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 17:36:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:36:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723151487] [2022-12-13 17:36:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723151487] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504405421] [2022-12-13 17:36:44,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:36:44,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:44,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:44,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 17:36:44,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 17:36:44,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:36:44,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:36:44,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 17:36:44,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504405421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-12-13 17:36:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311517215] [2022-12-13 17:36:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:36:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:44,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:36:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:36:44,614 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 17:36:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:44,643 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-12-13 17:36:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:36:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 99 [2022-12-13 17:36:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:44,644 INFO L225 Difference]: With dead ends: 83 [2022-12-13 17:36:44,644 INFO L226 Difference]: Without dead ends: 81 [2022-12-13 17:36:44,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:36:44,645 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:44,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 387 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-13 17:36:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-12-13 17:36:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 60 states have internal predecessors, (68), 14 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2022-12-13 17:36:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-12-13 17:36:44,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 99 [2022-12-13 17:36:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:44,650 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-12-13 17:36:44,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 17:36:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-12-13 17:36:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-13 17:36:44,651 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:44,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:44,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 17:36:44,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:44,852 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1285904367, now seen corresponding path program 1 times [2022-12-13 17:36:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:44,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106582728] [2022-12-13 17:36:44,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 17:36:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 17:36:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 17:36:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:36:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106582728] [2022-12-13 17:36:45,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106582728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487165753] [2022-12-13 17:36:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:45,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:45,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 17:36:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:45,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 17:36:45,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 17:36:45,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:36:45,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487165753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:36:45,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:36:45,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2022-12-13 17:36:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996801445] [2022-12-13 17:36:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:45,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:36:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:36:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-12-13 17:36:45,618 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-13 17:36:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:45,683 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2022-12-13 17:36:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:36:45,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 105 [2022-12-13 17:36:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:45,684 INFO L225 Difference]: With dead ends: 139 [2022-12-13 17:36:45,685 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 17:36:45,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:36:45,685 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 8 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:45,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 518 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:36:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 17:36:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-12-13 17:36:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-12-13 17:36:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-12-13 17:36:45,692 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 105 [2022-12-13 17:36:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:45,692 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-12-13 17:36:45,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-13 17:36:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-12-13 17:36:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:36:45,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:45,694 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:45,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 17:36:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:45,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 81682848, now seen corresponding path program 1 times [2022-12-13 17:36:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:45,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547797275] [2022-12-13 17:36:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:36:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:36:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:36:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:36:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:36:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:36:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 17:36:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:46,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547797275] [2022-12-13 17:36:46,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547797275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:46,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701736007] [2022-12-13 17:36:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:46,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:46,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:46,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 17:36:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:46,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 17:36:46,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:46,843 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-12-13 17:36:46,850 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-12-13 17:36:46,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:46,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:46,914 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-12-13 17:36:46,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:46,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:46,920 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-12-13 17:36:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 17:36:48,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:36:50,422 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 758 treesize of output 746 [2022-12-13 17:36:50,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:50,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:36:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 17:36:50,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701736007] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:50,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:36:50,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 24 [2022-12-13 17:36:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764082181] [2022-12-13 17:36:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:36:50,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:36:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:36:50,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:36:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2022-12-13 17:36:50,681 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:36:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:36:51,724 INFO L93 Difference]: Finished difference Result 152 states and 202 transitions. [2022-12-13 17:36:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:36:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 106 [2022-12-13 17:36:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:36:51,725 INFO L225 Difference]: With dead ends: 152 [2022-12-13 17:36:51,725 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 17:36:51,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 211 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=91, Invalid=610, Unknown=1, NotChecked=0, Total=702 [2022-12-13 17:36:51,725 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 58 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:36:51,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 373 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:36:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 17:36:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-12-13 17:36:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 24 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (33), 22 states have call predecessors, (33), 23 states have call successors, (33) [2022-12-13 17:36:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2022-12-13 17:36:51,735 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 106 [2022-12-13 17:36:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:36:51,735 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2022-12-13 17:36:51,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:36:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2022-12-13 17:36:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-13 17:36:51,736 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:36:51,736 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:36:51,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 17:36:51,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 17:36:51,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:36:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:36:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash -712475426, now seen corresponding path program 1 times [2022-12-13 17:36:51,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:36:51,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302430939] [2022-12-13 17:36:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:36:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:36:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:36:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:36:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 17:36:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:36:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:36:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 17:36:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 17:36:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 17:36:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:36:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:36:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302430939] [2022-12-13 17:36:52,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302430939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:36:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200138478] [2022-12-13 17:36:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:36:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:36:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:36:52,744 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:36:52,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 17:36:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:36:52,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 17:36:52,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:36:53,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 17:36:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:53,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 17:36:53,106 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-12-13 17:36:53,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 94 [2022-12-13 17:36:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:53,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 17:36:53,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-12-13 17:36:53,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:36:53,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2022-12-13 17:36:53,134 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 13 treesize of output 9 [2022-12-13 17:36:55,167 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_25| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_25|) 0)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_25|)) is different from true [2022-12-13 17:37:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 17:37:17,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:37:19,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:37:19,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-12-13 17:37:19,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:37:19,920 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 307 treesize of output 285 [2022-12-13 17:37:19,929 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 306 treesize of output 298 [2022-12-13 17:37:19,937 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 298 treesize of output 294 [2022-12-13 17:37:20,044 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 6 treesize of output 4 [2022-12-13 17:37:20,050 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 24 treesize of output 22 [2022-12-13 17:37:20,062 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 6 treesize of output 4 [2022-12-13 17:37:20,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:37:20,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2022-12-13 17:37:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:37:20,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200138478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:37:20,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:37:20,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 29 [2022-12-13 17:37:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936738777] [2022-12-13 17:37:20,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:37:20,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 17:37:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:37:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 17:37:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=658, Unknown=15, NotChecked=52, Total=812 [2022-12-13 17:37:20,252 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 10 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2022-12-13 17:37:22,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:24,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:26,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:28,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:30,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:32,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:34,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:38,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:40,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:42,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:44,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:46,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:48,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:54,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:56,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:37:58,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:00,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:08,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:10,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:16,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:18,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:25,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:27,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:29,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:31,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:33,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:35,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:37,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:43,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:45,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:47,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:49,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:51,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:53,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:55,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:57,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:38:59,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:01,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:03,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:11,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:13,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:21,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:23,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:25,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:27,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:29,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:31,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:33,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:35,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:41,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:43,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:45,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:47,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:49,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:51,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:53,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:55,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:57,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:39:59,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:01,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:03,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:05,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:07,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:09,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:11,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:12,495 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2022-12-13 17:40:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 17:40:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 10 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) Word has length 108 [2022-12-13 17:40:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:12,498 INFO L225 Difference]: With dead ends: 278 [2022-12-13 17:40:12,498 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 17:40:12,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=193, Invalid=1341, Unknown=30, NotChecked=76, Total=1640 [2022-12-13 17:40:12,500 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 210 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 186 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 135.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 135.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:12,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1529 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1569 Invalid, 67 Unknown, 220 Unchecked, 135.8s Time] [2022-12-13 17:40:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 17:40:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 148. [2022-12-13 17:40:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 114 states have internal predecessors, (136), 27 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (42), 25 states have call predecessors, (42), 26 states have call successors, (42) [2022-12-13 17:40:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 205 transitions. [2022-12-13 17:40:12,532 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 205 transitions. Word has length 108 [2022-12-13 17:40:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:12,532 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 205 transitions. [2022-12-13 17:40:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 10 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2022-12-13 17:40:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 205 transitions. [2022-12-13 17:40:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:40:12,533 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:12,533 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 17:40:12,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 17:40:12,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 17:40:12,735 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash -929434402, now seen corresponding path program 1 times [2022-12-13 17:40:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136611546] [2022-12-13 17:40:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:40:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 17:40:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:13,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136611546] [2022-12-13 17:40:13,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136611546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:13,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:40:13,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:40:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092867287] [2022-12-13 17:40:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:13,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 17:40:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 17:40:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:40:13,277 INFO L87 Difference]: Start difference. First operand 148 states and 205 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:40:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:13,602 INFO L93 Difference]: Finished difference Result 287 states and 411 transitions. [2022-12-13 17:40:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 17:40:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 106 [2022-12-13 17:40:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:13,603 INFO L225 Difference]: With dead ends: 287 [2022-12-13 17:40:13,603 INFO L226 Difference]: Without dead ends: 154 [2022-12-13 17:40:13,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:40:13,604 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:13,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 465 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 17:40:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-13 17:40:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-12-13 17:40:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 118 states have internal predecessors, (139), 27 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (42), 25 states have call predecessors, (42), 26 states have call successors, (42) [2022-12-13 17:40:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 208 transitions. [2022-12-13 17:40:13,620 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 208 transitions. Word has length 106 [2022-12-13 17:40:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:13,620 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 208 transitions. [2022-12-13 17:40:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-12-13 17:40:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 208 transitions. [2022-12-13 17:40:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:40:13,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:13,621 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:13,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:40:13,621 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1950502756, now seen corresponding path program 1 times [2022-12-13 17:40:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:13,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709863788] [2022-12-13 17:40:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:40:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:40:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:14,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709863788] [2022-12-13 17:40:14,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709863788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:40:14,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923631151] [2022-12-13 17:40:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:14,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:40:14,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:40:14,433 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:40:14,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 17:40:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:14,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 17:40:14,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:40:14,631 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:40:14,631 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-12-13 17:40:14,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:40:14,640 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-12-13 17:40:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 17:40:15,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:40:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:40:15,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923631151] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:40:15,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:40:15,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 11] total 30 [2022-12-13 17:40:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207283301] [2022-12-13 17:40:15,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:40:15,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 17:40:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 17:40:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2022-12-13 17:40:15,724 INFO L87 Difference]: Start difference. First operand 152 states and 208 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 10 states have call successors, (25) [2022-12-13 17:40:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:17,757 INFO L93 Difference]: Finished difference Result 540 states and 798 transitions. [2022-12-13 17:40:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 17:40:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 10 states have call successors, (25) Word has length 106 [2022-12-13 17:40:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:17,760 INFO L225 Difference]: With dead ends: 540 [2022-12-13 17:40:17,760 INFO L226 Difference]: Without dead ends: 445 [2022-12-13 17:40:17,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2022-12-13 17:40:17,761 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 488 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1352 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 17:40:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-12-13 17:40:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 356. [2022-12-13 17:40:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 259 states have (on average 1.247104247104247) internal successors, (323), 274 states have internal predecessors, (323), 66 states have call successors, (66), 17 states have call predecessors, (66), 30 states have return successors, (123), 64 states have call predecessors, (123), 64 states have call successors, (123) [2022-12-13 17:40:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 512 transitions. [2022-12-13 17:40:17,805 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 512 transitions. Word has length 106 [2022-12-13 17:40:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:17,805 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 512 transitions. [2022-12-13 17:40:17,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 29 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 10 states have call successors, (25) [2022-12-13 17:40:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 512 transitions. [2022-12-13 17:40:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:40:17,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:17,807 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:17,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 17:40:18,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 17:40:18,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1528811112, now seen corresponding path program 1 times [2022-12-13 17:40:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:18,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756092422] [2022-12-13 17:40:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:40:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 17:40:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:18,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756092422] [2022-12-13 17:40:18,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756092422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:40:18,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049451598] [2022-12-13 17:40:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:18,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:40:18,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:40:18,158 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:40:18,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 17:40:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:40:18,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:40:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 17:40:18,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:40:18,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049451598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:18,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:40:18,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 17:40:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023547693] [2022-12-13 17:40:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:18,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:40:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:40:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:40:18,337 INFO L87 Difference]: Start difference. First operand 356 states and 512 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:40:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:18,369 INFO L93 Difference]: Finished difference Result 510 states and 727 transitions. [2022-12-13 17:40:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:40:18,369 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 106 [2022-12-13 17:40:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:18,370 INFO L225 Difference]: With dead ends: 510 [2022-12-13 17:40:18,370 INFO L226 Difference]: Without dead ends: 201 [2022-12-13 17:40:18,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-12-13 17:40:18,372 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:18,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 233 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:40:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-13 17:40:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2022-12-13 17:40:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 145 states have internal predecessors, (166), 28 states have call successors, (28), 11 states have call predecessors, (28), 15 states have return successors, (42), 26 states have call predecessors, (42), 27 states have call successors, (42) [2022-12-13 17:40:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2022-12-13 17:40:18,389 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 106 [2022-12-13 17:40:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:18,389 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2022-12-13 17:40:18,389 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 17:40:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2022-12-13 17:40:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:40:18,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:18,390 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:18,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 17:40:18,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 17:40:18,592 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 350319834, now seen corresponding path program 2 times [2022-12-13 17:40:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:18,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726383162] [2022-12-13 17:40:18,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:40:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:40:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:19,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726383162] [2022-12-13 17:40:19,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726383162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:40:19,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172905402] [2022-12-13 17:40:19,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:40:19,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:40:19,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:40:19,069 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:40:19,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 17:40:19,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:40:19,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:40:19,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 17:40:19,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:40:19,257 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:40:19,258 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-12-13 17:40:19,270 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 17:40:19,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 17:40:21,445 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|))))) is different from true [2022-12-13 17:40:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-12-13 17:40:22,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:40:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 17:40:23,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172905402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:40:23,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:40:23,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 12] total 36 [2022-12-13 17:40:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023477185] [2022-12-13 17:40:23,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:40:23,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 17:40:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 17:40:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1071, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 17:40:23,004 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 33 states have internal predecessors, (165), 13 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2022-12-13 17:40:25,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:27,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:29,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:40:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:33,141 INFO L93 Difference]: Finished difference Result 799 states and 1272 transitions. [2022-12-13 17:40:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 17:40:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 33 states have internal predecessors, (165), 13 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) Word has length 106 [2022-12-13 17:40:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:33,147 INFO L225 Difference]: With dead ends: 799 [2022-12-13 17:40:33,147 INFO L226 Difference]: Without dead ends: 691 [2022-12-13 17:40:33,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 229 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=918, Invalid=6225, Unknown=1, NotChecked=166, Total=7310 [2022-12-13 17:40:33,149 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 696 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 337 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:33,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1482 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 2699 Invalid, 3 Unknown, 384 Unchecked, 8.1s Time] [2022-12-13 17:40:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-12-13 17:40:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 510. [2022-12-13 17:40:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 389 states have (on average 1.2107969151670952) internal successors, (471), 411 states have internal predecessors, (471), 79 states have call successors, (79), 21 states have call predecessors, (79), 41 states have return successors, (170), 77 states have call predecessors, (170), 77 states have call successors, (170) [2022-12-13 17:40:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 720 transitions. [2022-12-13 17:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 720 transitions. Word has length 106 [2022-12-13 17:40:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:33,217 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 720 transitions. [2022-12-13 17:40:33,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.583333333333333) internal successors, (165), 33 states have internal predecessors, (165), 13 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2022-12-13 17:40:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 720 transitions. [2022-12-13 17:40:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 17:40:33,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:33,219 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:33,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 17:40:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:40:33,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -467328616, now seen corresponding path program 1 times [2022-12-13 17:40:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:33,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588055367] [2022-12-13 17:40:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 17:40:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 17:40:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588055367] [2022-12-13 17:40:33,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588055367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:33,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:40:33,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:40:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575305755] [2022-12-13 17:40:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:33,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:40:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:40:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:40:33,562 INFO L87 Difference]: Start difference. First operand 510 states and 720 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 17:40:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:33,690 INFO L93 Difference]: Finished difference Result 997 states and 1461 transitions. [2022-12-13 17:40:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:40:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 106 [2022-12-13 17:40:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:33,694 INFO L225 Difference]: With dead ends: 997 [2022-12-13 17:40:33,694 INFO L226 Difference]: Without dead ends: 413 [2022-12-13 17:40:33,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:40:33,697 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:33,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 304 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:40:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-12-13 17:40:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-12-13 17:40:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 303 states have (on average 1.1782178217821782) internal successors, (357), 320 states have internal predecessors, (357), 73 states have call successors, (73), 21 states have call predecessors, (73), 36 states have return successors, (137), 71 states have call predecessors, (137), 71 states have call successors, (137) [2022-12-13 17:40:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 567 transitions. [2022-12-13 17:40:33,747 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 567 transitions. Word has length 106 [2022-12-13 17:40:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:33,747 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 567 transitions. [2022-12-13 17:40:33,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 17:40:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 567 transitions. [2022-12-13 17:40:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 17:40:33,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:33,749 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:33,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 17:40:33,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1063573994, now seen corresponding path program 1 times [2022-12-13 17:40:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:33,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39654579] [2022-12-13 17:40:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:40:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:40:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:40:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 17:40:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 17:40:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 17:40:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 17:40:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:40:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:40:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-13 17:40:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:40:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39654579] [2022-12-13 17:40:33,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39654579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:40:33,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:40:33,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:40:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812972388] [2022-12-13 17:40:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:40:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:40:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:40:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:40:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:40:33,989 INFO L87 Difference]: Start difference. First operand 413 states and 567 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 17:40:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:40:34,101 INFO L93 Difference]: Finished difference Result 445 states and 617 transitions. [2022-12-13 17:40:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:40:34,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 113 [2022-12-13 17:40:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:40:34,103 INFO L225 Difference]: With dead ends: 445 [2022-12-13 17:40:34,104 INFO L226 Difference]: Without dead ends: 443 [2022-12-13 17:40:34,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:40:34,104 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:40:34,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 474 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:40:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-12-13 17:40:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 430. [2022-12-13 17:40:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 313 states have (on average 1.1725239616613419) internal successors, (367), 333 states have internal predecessors, (367), 76 states have call successors, (76), 22 states have call predecessors, (76), 40 states have return successors, (154), 74 states have call predecessors, (154), 74 states have call successors, (154) [2022-12-13 17:40:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 597 transitions. [2022-12-13 17:40:34,170 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 597 transitions. Word has length 113 [2022-12-13 17:40:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:40:34,170 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 597 transitions. [2022-12-13 17:40:34,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 17:40:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 597 transitions. [2022-12-13 17:40:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 17:40:34,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:40:34,172 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:34,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 17:40:34,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:40:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:40:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1777957958, now seen corresponding path program 1 times [2022-12-13 17:40:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:40:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034896592] [2022-12-13 17:40:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:40:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:40:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:40:34,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:40:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:40:34,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:40:34,256 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:40:34,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 17:40:34,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 17:40:34,261 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:40:34,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:40:34,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:40:34 BoogieIcfgContainer [2022-12-13 17:40:34,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:40:34,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:40:34,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:40:34,308 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:40:34,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:35" (3/4) ... [2022-12-13 17:40:34,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:40:34,352 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:40:34,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:40:34,352 INFO L158 Benchmark]: Toolchain (without parser) took 241142.77ms. Allocated memory was 182.5MB in the beginning and 438.3MB in the end (delta: 255.9MB). Free memory was 105.2MB in the beginning and 300.6MB in the end (delta: -195.4MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,353 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:40:34,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1436.61ms. Allocated memory is still 182.5MB. Free memory was 104.9MB in the beginning and 115.7MB in the end (delta: -10.8MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.39ms. Allocated memory is still 182.5MB. Free memory was 115.7MB in the beginning and 110.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,353 INFO L158 Benchmark]: Boogie Preprocessor took 36.91ms. Allocated memory is still 182.5MB. Free memory was 110.5MB in the beginning and 107.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,354 INFO L158 Benchmark]: RCFGBuilder took 434.30ms. Allocated memory is still 182.5MB. Free memory was 107.3MB in the beginning and 83.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,354 INFO L158 Benchmark]: TraceAbstraction took 239092.30ms. Allocated memory was 182.5MB in the beginning and 438.3MB in the end (delta: 255.9MB). Free memory was 83.3MB in the beginning and 307.9MB in the end (delta: -224.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,354 INFO L158 Benchmark]: Witness Printer took 44.71ms. Allocated memory is still 438.3MB. Free memory was 307.9MB in the beginning and 300.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 17:40:34,355 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.13ms. Allocated memory is still 182.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1436.61ms. Allocated memory is still 182.5MB. Free memory was 104.9MB in the beginning and 115.7MB in the end (delta: -10.8MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.39ms. Allocated memory is still 182.5MB. Free memory was 115.7MB in the beginning and 110.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.91ms. Allocated memory is still 182.5MB. Free memory was 110.5MB in the beginning and 107.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 434.30ms. Allocated memory is still 182.5MB. Free memory was 107.3MB in the beginning and 83.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 239092.30ms. Allocated memory was 182.5MB in the beginning and 438.3MB in the end (delta: 255.9MB). Free memory was 83.3MB in the beginning and 307.9MB in the end (delta: -224.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 44.71ms. Allocated memory is still 438.3MB. Free memory was 307.9MB in the beginning and 300.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6913-L6918] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7358] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7392] CALL aws_linked_list_rbegin_harness() [L7376] struct aws_linked_list list; [L7378] CALL ensure_linked_list_is_allocated(&list, 20) [L6755] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6755] RET, EXPR nondet_uint64_t() VAL [\old(max_length)=20, list={6:0}, list={6:0}, max_length=20, nondet_uint64_t()=-18446744073709551616, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] size_t length = nondet_uint64_t(); [L6756] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6756] RET assume_abort_if_not(length <= max_length) VAL [\old(max_length)=20, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6758-L6759] list->head.prev = ((void *)0) [L6761-L6762] list->tail.next = ((void *)0) [L6765] struct aws_linked_list_node *curr = &list->head; [L6767] size_t i = 0; VAL [\old(max_length)=20, curr={6:0}, i=0, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6767] COND FALSE !(i < length) VAL [\old(max_length)=20, curr={6:0}, i=0, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6776] curr->next = &list->tail [L6777] list->tail.prev = curr VAL [\old(max_length)=20, curr={6:0}, i=0, length=0, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7378] RET ensure_linked_list_is_allocated(&list, 20) [L7381] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, list && list->head.next=1, list->head.next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.next={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, node && node->next=1, node->next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={6:16}, node->next={6:16}, node->next->prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7381] RET, EXPR aws_linked_list_is_valid(&list) VAL [aws_linked_list_is_valid(&list)=1, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7381] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7381] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [aws_linked_list_is_valid(&list)=1, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7386] CALL aws_linked_list_rbegin(&list) [L4812] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, list && list->head.next=1, list->head.next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.next={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, node && node->next=1, node->next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={6:16}, node->next={6:16}, node->next->prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4812] RET, EXPR aws_linked_list_is_valid(list) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4813] EXPR list->tail.prev [L4813] struct aws_linked_list_node *rval = list->tail.prev; [L4814] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, list && list->head.next=1, list->head.next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0)=1, list->head.next={6:16}, list->head.prev={0:0}, list->tail.next={0:0}, list->tail.prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, node && node->next=1, node->next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={6:16}, node->next={6:16}, node->next->prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4814] RET, EXPR aws_linked_list_is_valid(list) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, rval={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4814] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 239.0s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 187.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 2161 SdHoareTripleChecker+Valid, 146.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2106 mSDsluCounter, 10717 SdHoareTripleChecker+Invalid, 145.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 604 IncrementalHoareTripleChecker+Unchecked, 8992 mSDsCounter, 930 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6999 IncrementalHoareTripleChecker+Invalid, 8603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 930 mSolverCounterUnsat, 1725 mSDtfsCounter, 6999 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2662 GetRequests, 2266 SyntacticMatches, 19 SemanticMatches, 377 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 73.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=19, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 391 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 44.2s InterpolantComputationTime, 3585 NumberOfCodeBlocks, 3515 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3853 ConstructedInterpolants, 180 QuantifiedInterpolants, 15039 SizeOfPredicates, 128 NumberOfNonLiveVariables, 6983 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 42 InterpolantComputations, 18 PerfectInterpolantSequences, 2070/2513 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 17:40:34,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d9caba-0532-4e00-ace8-829740f1571a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE