./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc --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 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d --- 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-5e519f3 [2022-11-02 21:08:38,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:08:38,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:08:38,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:08:38,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:08:38,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:08:38,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:08:38,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:08:38,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:08:38,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:08:38,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:08:38,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:08:38,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:08:38,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:08:38,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:08:38,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:08:38,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:08:38,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:08:38,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:08:38,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:08:38,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:08:38,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:08:38,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:08:38,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:08:38,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:08:38,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:08:38,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:08:38,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:08:38,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:08:38,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:08:38,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:08:38,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:08:38,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:08:38,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:08:38,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:08:38,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:08:38,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:08:38,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:08:38,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:08:38,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:08:38,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:08:38,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:08:39,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:08:39,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:08:39,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:08:39,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:08:39,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:08:39,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:08:39,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:08:39,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:08:39,026 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:08:39,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:08:39,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:08:39,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:08:39,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:08:39,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:08:39,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:08:39,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:08:39,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:08:39,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:08:39,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:08:39,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:08:39,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:08:39,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:39,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:08:39,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:08:39,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:08:39,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:08:39,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:08:39,033 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:08:39,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:08:39,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:08:39,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc 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 -> 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d [2022-11-02 21:08:39,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:08:39,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:08:39,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:08:39,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:08:39,377 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:08:39,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2022-11-02 21:08:39,463 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/data/9259d9f86/93f7fe44847e460eaa0240cda8c6c1a7/FLAGd6ffe6956 [2022-11-02 21:08:40,158 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:08:40,159 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2022-11-02 21:08:40,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/data/9259d9f86/93f7fe44847e460eaa0240cda8c6c1a7/FLAGd6ffe6956 [2022-11-02 21:08:40,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/data/9259d9f86/93f7fe44847e460eaa0240cda8c6c1a7 [2022-11-02 21:08:40,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:08:40,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:08:40,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:40,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:08:40,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:08:40,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:40" (1/1) ... [2022-11-02 21:08:40,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcc8b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:40, skipping insertion in model container [2022-11-02 21:08:40,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:40" (1/1) ... [2022-11-02 21:08:40,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:08:40,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:08:40,674 WARN L230 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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2022-11-02 21:08:40,679 WARN L230 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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2022-11-02 21:08:41,598 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,599 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,599 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,601 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,607 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,632 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,633 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,640 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,643 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,644 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,646 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,647 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:41,647 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,013 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 21:08:42,014 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 21:08:42,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 21:08:42,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 21:08:42,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 21:08:42,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 21:08:42,019 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 21:08:42,020 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 21:08:42,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 21:08:42,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 21:08:42,173 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 21:08:42,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:42,227 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:08:42,240 WARN L230 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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2022-11-02 21:08:42,241 WARN L230 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_f384bbc5-d5a1-46d6-887f-d8cc186de4db/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2022-11-02 21:08:42,298 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,299 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,299 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,300 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,301 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,308 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,309 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,310 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,311 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,312 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,313 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,313 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,313 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 21:08:42,354 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 21:08:42,360 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 21:08:42,363 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 21:08:42,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 21:08:42,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 21:08:42,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 21:08:42,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 21:08:42,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 21:08:42,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 21:08:42,368 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 21:08:42,389 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 21:08:42,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:42,630 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:08:42,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42 WrapperNode [2022-11-02 21:08:42,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:42,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:42,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:08:42,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:08:42,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,779 INFO L138 Inliner]: procedures = 679, calls = 1036, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2022-11-02 21:08:42,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:42,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:08:42,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:08:42,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:08:42,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:08:42,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:08:42,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:08:42,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:08:42,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (1/1) ... [2022-11-02 21:08:42,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:42,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:42,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:08:42,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:08:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2022-11-02 21:08:42,919 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2022-11-02 21:08:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:08:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 21:08:42,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 21:08:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-02 21:08:42,921 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-02 21:08:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-02 21:08:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-02 21:08:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:08:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:08:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:08:42,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:08:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-02 21:08:42,925 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-02 21:08:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:08:42,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:08:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:08:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:08:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:08:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:08:43,215 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:08:43,217 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:08:43,538 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:08:43,545 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:08:43,545 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:08:43,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:43 BoogieIcfgContainer [2022-11-02 21:08:43,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:08:43,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:08:43,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:08:43,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:08:43,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:08:40" (1/3) ... [2022-11-02 21:08:43,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade9712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:43, skipping insertion in model container [2022-11-02 21:08:43,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:42" (2/3) ... [2022-11-02 21:08:43,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade9712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:43, skipping insertion in model container [2022-11-02 21:08:43,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:43" (3/3) ... [2022-11-02 21:08:43,567 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2022-11-02 21:08:43,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:08:43,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:08:43,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:43,681 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;@6b2c729e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:43,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:08:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-02 21:08:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:43,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:43,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:43,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:43,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2022-11-02 21:08:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:43,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512348089] [2022-11-02 21:08:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:44,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512348089] [2022-11-02 21:08:44,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512348089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:44,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:44,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771197720] [2022-11-02 21:08:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:44,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:44,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:44,161 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:44,206 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-11-02 21:08:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:44,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-02 21:08:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:44,218 INFO L225 Difference]: With dead ends: 117 [2022-11-02 21:08:44,218 INFO L226 Difference]: Without dead ends: 56 [2022-11-02 21:08:44,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:44,225 INFO L413 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:44,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:08:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-02 21:08:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-02 21:08:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 21:08:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-11-02 21:08:44,266 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-11-02 21:08:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:44,267 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-11-02 21:08:44,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-11-02 21:08:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:44,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:44,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:08:44,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2022-11-02 21:08:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:44,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801710292] [2022-11-02 21:08:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:45,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801710292] [2022-11-02 21:08:45,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801710292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:45,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:45,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:08:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697863081] [2022-11-02 21:08:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:08:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:08:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:08:45,561 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:45,875 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2022-11-02 21:08:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:08:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-02 21:08:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:45,881 INFO L225 Difference]: With dead ends: 108 [2022-11-02 21:08:45,882 INFO L226 Difference]: Without dead ends: 59 [2022-11-02 21:08:45,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:45,885 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:45,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 320 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-02 21:08:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-02 21:08:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-02 21:08:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-11-02 21:08:45,911 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2022-11-02 21:08:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:45,913 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-11-02 21:08:45,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-11-02 21:08:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:45,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:45,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:08:45,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2022-11-02 21:08:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:45,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390606785] [2022-11-02 21:08:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:46,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390606785] [2022-11-02 21:08:46,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390606785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:46,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:46,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:08:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166850818] [2022-11-02 21:08:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:46,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:08:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:08:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:08:46,832 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:47,181 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2022-11-02 21:08:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:08:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-02 21:08:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:47,183 INFO L225 Difference]: With dead ends: 124 [2022-11-02 21:08:47,183 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 21:08:47,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:08:47,185 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:47,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 409 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 21:08:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-02 21:08:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 52 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-02 21:08:47,196 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2022-11-02 21:08:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:47,197 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-02 21:08:47,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-11-02 21:08:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:47,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:47,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:47,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:08:47,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2022-11-02 21:08:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:47,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525256403] [2022-11-02 21:08:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:48,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525256403] [2022-11-02 21:08:48,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525256403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:48,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:48,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:08:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051556808] [2022-11-02 21:08:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:08:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:08:48,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:08:48,002 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:48,305 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2022-11-02 21:08:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:08:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-02 21:08:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:48,308 INFO L225 Difference]: With dead ends: 152 [2022-11-02 21:08:48,308 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 21:08:48,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:08:48,311 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 87 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:48,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 375 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 21:08:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-11-02 21:08:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2022-11-02 21:08:48,335 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 26 [2022-11-02 21:08:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:48,335 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2022-11-02 21:08:48,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2022-11-02 21:08:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:48,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:48,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:08:48,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2022-11-02 21:08:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831197409] [2022-11-02 21:08:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:48,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831197409] [2022-11-02 21:08:48,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831197409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:48,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:48,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:08:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734482322] [2022-11-02 21:08:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:48,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:08:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:08:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:08:48,684 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:48,997 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2022-11-02 21:08:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:08:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-02 21:08:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:49,003 INFO L225 Difference]: With dead ends: 176 [2022-11-02 21:08:49,004 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 21:08:49,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:08:49,012 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:49,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 480 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 21:08:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2022-11-02 21:08:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.396551724137931) internal successors, (81), 60 states have internal predecessors, (81), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-11-02 21:08:49,029 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 26 [2022-11-02 21:08:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:49,029 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-11-02 21:08:49,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:08:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-11-02 21:08:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:08:49,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:49,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:49,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:08:49,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2022-11-02 21:08:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:49,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066335012] [2022-11-02 21:08:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066335012] [2022-11-02 21:08:49,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066335012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:49,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:49,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:08:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084113021] [2022-11-02 21:08:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:49,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:08:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:08:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:49,202 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:49,294 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2022-11-02 21:08:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:08:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-02 21:08:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:49,296 INFO L225 Difference]: With dead ends: 173 [2022-11-02 21:08:49,296 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 21:08:49,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:08:49,297 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 45 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:49,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 380 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 21:08:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 21:08:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 53 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-02 21:08:49,308 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 26 [2022-11-02 21:08:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-02 21:08:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-02 21:08:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:08:49,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:49,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:49,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:08:49,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2022-11-02 21:08:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570703069] [2022-11-02 21:08:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:49,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570703069] [2022-11-02 21:08:49,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570703069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:49,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:49,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:08:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952177219] [2022-11-02 21:08:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:49,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:08:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:08:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:08:49,501 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:49,666 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2022-11-02 21:08:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:08:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-02 21:08:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:49,668 INFO L225 Difference]: With dead ends: 141 [2022-11-02 21:08:49,668 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 21:08:49,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:08:49,670 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:49,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 319 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 21:08:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-11-02 21:08:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 53 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-11-02 21:08:49,688 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 28 [2022-11-02 21:08:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:49,688 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-11-02 21:08:49,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-11-02 21:08:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 21:08:49,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:49,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:08:49,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2022-11-02 21:08:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752783220] [2022-11-02 21:08:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752783220] [2022-11-02 21:08:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752783220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:08:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808948425] [2022-11-02 21:08:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:08:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:08:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:08:49,923 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:50,157 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2022-11-02 21:08:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:08:50,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 21:08:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:50,159 INFO L225 Difference]: With dead ends: 159 [2022-11-02 21:08:50,159 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 21:08:50,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:50,161 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 64 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:50,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 21:08:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2022-11-02 21:08:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 55 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-11-02 21:08:50,174 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2022-11-02 21:08:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:50,174 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-11-02 21:08:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-11-02 21:08:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:08:50,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:50,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:50,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:08:50,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2022-11-02 21:08:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:50,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278139084] [2022-11-02 21:08:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:50,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278139084] [2022-11-02 21:08:50,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278139084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:50,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:50,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:08:50,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333998924] [2022-11-02 21:08:50,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:50,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:08:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:08:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:08:50,365 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:50,449 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-11-02 21:08:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:08:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-02 21:08:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:50,453 INFO L225 Difference]: With dead ends: 149 [2022-11-02 21:08:50,453 INFO L226 Difference]: Without dead ends: 84 [2022-11-02 21:08:50,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:50,456 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:50,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:08:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-02 21:08:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2022-11-02 21:08:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.290909090909091) internal successors, (71), 57 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-02 21:08:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-11-02 21:08:50,472 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2022-11-02 21:08:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:50,472 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-11-02 21:08:50,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:08:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-11-02 21:08:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:08:50,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:50,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:08:50,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2022-11-02 21:08:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:50,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144742681] [2022-11-02 21:08:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144742681] [2022-11-02 21:08:52,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144742681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:52,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:52,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:08:52,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565339974] [2022-11-02 21:08:52,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:52,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:08:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:08:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:08:52,427 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:08:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:53,069 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-11-02 21:08:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:08:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-11-02 21:08:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:53,070 INFO L225 Difference]: With dead ends: 164 [2022-11-02 21:08:53,071 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 21:08:53,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:08:53,072 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:53,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 482 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:08:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 21:08:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2022-11-02 21:08:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-02 21:08:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-11-02 21:08:53,089 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2022-11-02 21:08:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:53,090 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-11-02 21:08:53,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:08:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-11-02 21:08:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:08:53,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:53,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:53,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:08:53,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2022-11-02 21:08:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:53,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936764664] [2022-11-02 21:08:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:53,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:53,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936764664] [2022-11-02 21:08:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936764664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:08:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823306699] [2022-11-02 21:08:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:08:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:08:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:08:53,718 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:08:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:54,206 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2022-11-02 21:08:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:08:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-11-02 21:08:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:54,209 INFO L225 Difference]: With dead ends: 192 [2022-11-02 21:08:54,209 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 21:08:54,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:08:54,210 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:54,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 519 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:08:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 21:08:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2022-11-02 21:08:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 66 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-02 21:08:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-11-02 21:08:54,226 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 39 [2022-11-02 21:08:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:54,228 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-11-02 21:08:54,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:08:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-11-02 21:08:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:08:54,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:54,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:08:54,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2022-11-02 21:08:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:54,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151116606] [2022-11-02 21:08:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:54,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:54,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151116606] [2022-11-02 21:08:54,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151116606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:54,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:54,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:08:54,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920170630] [2022-11-02 21:08:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:54,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:08:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:08:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:08:54,564 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:08:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:54,846 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2022-11-02 21:08:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:08:54,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-11-02 21:08:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:54,848 INFO L225 Difference]: With dead ends: 201 [2022-11-02 21:08:54,848 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 21:08:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:08:54,849 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:54,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:08:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 21:08:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2022-11-02 21:08:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 67 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-02 21:08:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-11-02 21:08:54,862 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2022-11-02 21:08:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:54,863 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-11-02 21:08:54,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:08:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-11-02 21:08:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:08:54,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:54,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:08:54,865 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2022-11-02 21:08:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:54,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103610274] [2022-11-02 21:08:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103610274] [2022-11-02 21:08:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103610274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350234099] [2022-11-02 21:08:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:55,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:55,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:08:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-02 21:08:55,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:57,000 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-11-02 21:08:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:57,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:57,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350234099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:57,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:57,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 8] total 27 [2022-11-02 21:08:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613632112] [2022-11-02 21:08:57,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:57,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 21:08:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 21:08:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=586, Unknown=1, NotChecked=48, Total=702 [2022-11-02 21:08:57,494 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-02 21:08:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:58,774 INFO L93 Difference]: Finished difference Result 233 states and 321 transitions. [2022-11-02 21:08:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:08:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 41 [2022-11-02 21:08:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:58,776 INFO L225 Difference]: With dead ends: 233 [2022-11-02 21:08:58,776 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 21:08:58,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=188, Invalid=1455, Unknown=1, NotChecked=78, Total=1722 [2022-11-02 21:08:58,778 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 204 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:58,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 943 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 928 Invalid, 0 Unknown, 197 Unchecked, 0.7s Time] [2022-11-02 21:08:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 21:08:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 102. [2022-11-02 21:08:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 82 states have internal predecessors, (100), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2022-11-02 21:08:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-11-02 21:08:58,802 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 41 [2022-11-02 21:08:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:58,803 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-11-02 21:08:58,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-02 21:08:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-11-02 21:08:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:08:58,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:58,804 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:58,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:59,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:08:59,031 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2022-11-02 21:08:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:59,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690306425] [2022-11-02 21:08:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:08:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:59,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690306425] [2022-11-02 21:08:59,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690306425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:59,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:59,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:08:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828622898] [2022-11-02 21:08:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:59,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:08:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:08:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:08:59,261 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:08:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:59,345 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2022-11-02 21:08:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:08:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-11-02 21:08:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:59,349 INFO L225 Difference]: With dead ends: 118 [2022-11-02 21:08:59,350 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 21:08:59,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:08:59,351 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:59,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 452 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:08:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 21:08:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2022-11-02 21:08:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 89 states have internal predecessors, (106), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (24), 13 states have call predecessors, (24), 14 states have call successors, (24) [2022-11-02 21:08:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2022-11-02 21:08:59,391 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 42 [2022-11-02 21:08:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:59,393 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2022-11-02 21:08:59,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:08:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-11-02 21:08:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 21:08:59,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:59,394 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:08:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:08:59,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2022-11-02 21:08:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:59,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060690701] [2022-11-02 21:08:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:08:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:08:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:09:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:09:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060690701] [2022-11-02 21:09:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060690701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245635288] [2022-11-02 21:09:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:00,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:00,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:09:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:00,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-02 21:09:00,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:00,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-02 21:09:00,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-11-02 21:09:43,638 WARN L234 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:09:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:43,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 21:09:44,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245635288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:44,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:44,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 25 [2022-11-02 21:09:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180101074] [2022-11-02 21:09:44,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:44,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:09:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:09:44,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=507, Unknown=11, NotChecked=0, Total=600 [2022-11-02 21:09:44,552 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-02 21:10:05,279 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:10:17,364 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:10:29,457 WARN L234 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:10:41,535 WARN L234 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:10:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:41,938 INFO L93 Difference]: Finished difference Result 367 states and 484 transitions. [2022-11-02 21:10:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 21:10:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 50 [2022-11-02 21:10:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:41,941 INFO L225 Difference]: With dead ends: 367 [2022-11-02 21:10:41,941 INFO L226 Difference]: Without dead ends: 206 [2022-11-02 21:10:41,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 100.0s TimeCoverageRelationStatistics Valid=199, Invalid=1422, Unknown=19, NotChecked=0, Total=1640 [2022-11-02 21:10:41,943 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 161 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1006 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 205 Invalid, 0 Unknown, 156 Unchecked, 0.4s Time] [2022-11-02 21:10:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-02 21:10:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2022-11-02 21:10:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 119 states have internal predecessors, (143), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (26), 15 states have call predecessors, (26), 16 states have call successors, (26) [2022-11-02 21:10:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2022-11-02 21:10:41,967 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 50 [2022-11-02 21:10:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:41,967 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2022-11-02 21:10:41,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-02 21:10:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2022-11-02 21:10:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:10:41,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:41,969 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:10:41,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:42,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 21:10:42,175 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2080562516, now seen corresponding path program 2 times [2022-11-02 21:10:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:42,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764678376] [2022-11-02 21:10:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:10:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:10:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764678376] [2022-11-02 21:10:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764678376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:42,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:10:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781341275] [2022-11-02 21:10:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:10:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:10:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:42,705 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 21:10:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:42,999 INFO L93 Difference]: Finished difference Result 266 states and 345 transitions. [2022-11-02 21:10:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:10:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-02 21:10:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:43,001 INFO L225 Difference]: With dead ends: 266 [2022-11-02 21:10:43,001 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 21:10:43,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:10:43,003 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:43,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 374 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:10:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 21:10:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2022-11-02 21:10:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 125 states have internal predecessors, (148), 17 states have call successors, (17), 11 states have call predecessors, (17), 16 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2022-11-02 21:10:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 194 transitions. [2022-11-02 21:10:43,030 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 194 transitions. Word has length 52 [2022-11-02 21:10:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:43,030 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 194 transitions. [2022-11-02 21:10:43,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 21:10:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 194 transitions. [2022-11-02 21:10:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 21:10:43,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:43,031 INFO L195 NwaCegarLoop]: trace histogram [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-11-02 21:10:43,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:10:43,032 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 48376912, now seen corresponding path program 1 times [2022-11-02 21:10:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:43,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607968993] [2022-11-02 21:10:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:10:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:10:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:43,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607968993] [2022-11-02 21:10:43,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607968993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:43,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:43,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939797305] [2022-11-02 21:10:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:43,352 INFO L87 Difference]: Start difference. First operand 153 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:10:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:43,405 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2022-11-02 21:10:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:10:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-11-02 21:10:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:43,407 INFO L225 Difference]: With dead ends: 263 [2022-11-02 21:10:43,408 INFO L226 Difference]: Without dead ends: 137 [2022-11-02 21:10:43,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-02 21:10:43,409 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:43,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 250 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:10:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-02 21:10:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2022-11-02 21:10:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 106 states have internal predecessors, (127), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-02 21:10:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2022-11-02 21:10:43,427 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 52 [2022-11-02 21:10:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:43,427 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2022-11-02 21:10:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:10:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-11-02 21:10:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 21:10:43,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:43,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:10:43,429 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2022-11-02 21:10:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:43,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142301547] [2022-11-02 21:10:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:10:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:10:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:10:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:44,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142301547] [2022-11-02 21:10:44,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142301547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:44,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:44,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:10:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122640012] [2022-11-02 21:10:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:44,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:10:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:10:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:44,176 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:10:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:44,450 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2022-11-02 21:10:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:10:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-02 21:10:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:44,452 INFO L225 Difference]: With dead ends: 138 [2022-11-02 21:10:44,452 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 21:10:44,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:10:44,453 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:44,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 502 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:10:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 21:10:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-02 21:10:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 107 states have internal predecessors, (128), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-02 21:10:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2022-11-02 21:10:44,472 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 58 [2022-11-02 21:10:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:44,473 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2022-11-02 21:10:44,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:10:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2022-11-02 21:10:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 21:10:44,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:44,474 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:44,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:10:44,475 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2022-11-02 21:10:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:44,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481205980] [2022-11-02 21:10:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:44,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:10:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:10:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:10:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 21:10:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:10:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:10:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:45,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481205980] [2022-11-02 21:10:45,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481205980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:45,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:45,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:10:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194103229] [2022-11-02 21:10:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:10:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:10:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:45,794 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-02 21:10:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:46,420 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2022-11-02 21:10:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:10:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2022-11-02 21:10:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:46,424 INFO L225 Difference]: With dead ends: 143 [2022-11-02 21:10:46,424 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 21:10:46,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:10:46,425 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:46,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:10:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 21:10:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-02 21:10:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-02 21:10:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2022-11-02 21:10:46,450 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 78 [2022-11-02 21:10:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:46,450 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2022-11-02 21:10:46,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-02 21:10:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2022-11-02 21:10:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 21:10:46,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:46,454 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:46,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:10:46,454 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2022-11-02 21:10:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:46,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423407786] [2022-11-02 21:10:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:10:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:10:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:10:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 21:10:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:10:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:10:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423407786] [2022-11-02 21:10:48,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423407786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894052667] [2022-11-02 21:10:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:48,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:48,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:10:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 21:10:49,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:49,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:49,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:10:49,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-02 21:10:52,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-02 21:11:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 5 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:07,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:08,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 6 [2022-11-02 21:11:08,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 6 [2022-11-02 21:11:09,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 6 [2022-11-02 21:11:09,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894052667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:09,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:11:09,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2022-11-02 21:11:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009738169] [2022-11-02 21:11:09,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:09,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 21:11:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 21:11:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2368, Unknown=1, NotChecked=0, Total=2550 [2022-11-02 21:11:09,548 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2022-11-02 21:11:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:34,695 INFO L93 Difference]: Finished difference Result 244 states and 303 transitions. [2022-11-02 21:11:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-02 21:11:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) Word has length 78 [2022-11-02 21:11:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:34,697 INFO L225 Difference]: With dead ends: 244 [2022-11-02 21:11:34,698 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 21:11:34,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=450, Invalid=6190, Unknown=2, NotChecked=0, Total=6642 [2022-11-02 21:11:34,701 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:34,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 775 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 875 Invalid, 0 Unknown, 459 Unchecked, 0.8s Time] [2022-11-02 21:11:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 21:11:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 169. [2022-11-02 21:11:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 139 states have internal predecessors, (159), 17 states have call successors, (17), 15 states have call predecessors, (17), 16 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-02 21:11:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2022-11-02 21:11:34,731 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 78 [2022-11-02 21:11:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:34,732 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2022-11-02 21:11:34,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2022-11-02 21:11:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2022-11-02 21:11:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 21:11:34,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:34,733 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:34,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:11:34,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:34,947 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1852877617, now seen corresponding path program 1 times [2022-11-02 21:11:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035482478] [2022-11-02 21:11:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:11:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:11:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:11:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:11:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 21:11:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:11:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 21:11:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:36,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035482478] [2022-11-02 21:11:36,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035482478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:36,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262499049] [2022-11-02 21:11:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:36,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:36,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:11:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:36,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 21:11:36,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 21:11:38,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:38,983 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:11:38,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-02 21:11:38,998 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 21:11:38,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 21:11:39,184 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:11:39,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-02 21:11:39,197 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 21:11:39,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 21:11:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:11:39,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262499049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:39,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:39,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 13] total 35 [2022-11-02 21:11:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970342258] [2022-11-02 21:11:39,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:39,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 21:11:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 21:11:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 21:11:39,220 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-02 21:11:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:40,720 INFO L93 Difference]: Finished difference Result 234 states and 275 transitions. [2022-11-02 21:11:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:11:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 78 [2022-11-02 21:11:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:40,722 INFO L225 Difference]: With dead ends: 234 [2022-11-02 21:11:40,722 INFO L226 Difference]: Without dead ends: 227 [2022-11-02 21:11:40,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 147 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=379, Invalid=2071, Unknown=0, NotChecked=0, Total=2450 [2022-11-02 21:11:40,724 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 239 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:40,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 342 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 677 Invalid, 0 Unknown, 261 Unchecked, 0.7s Time] [2022-11-02 21:11:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-02 21:11:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2022-11-02 21:11:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.1847133757961783) internal successors, (186), 161 states have internal predecessors, (186), 18 states have call successors, (18), 17 states have call predecessors, (18), 19 states have return successors, (26), 16 states have call predecessors, (26), 17 states have call successors, (26) [2022-11-02 21:11:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2022-11-02 21:11:40,759 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 78 [2022-11-02 21:11:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:40,760 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2022-11-02 21:11:40,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-11-02 21:11:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2022-11-02 21:11:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 21:11:40,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:40,761 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:40,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 21:11:40,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:40,969 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2111043055, now seen corresponding path program 1 times [2022-11-02 21:11:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:40,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663143287] [2022-11-02 21:11:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:11:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:11:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:11:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:11:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:11:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 21:11:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:11:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:11:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:42,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663143287] [2022-11-02 21:11:42,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663143287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:11:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589864412] [2022-11-02 21:11:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:11:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:42,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:11:42,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:11:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:42,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 21:11:42,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:11:43,748 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2022-11-02 21:11:44,970 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22|) 0)))) is different from true [2022-11-02 21:11:46,126 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|) 0)))) is different from true [2022-11-02 21:11:47,268 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|) 0)))) is different from true [2022-11-02 21:11:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-11-02 21:11:47,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:11:48,768 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:11:48,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-02 21:11:48,778 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 21:11:48,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-02 21:11:48,955 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:11:48,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-02 21:11:48,969 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 21:11:48,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-02 21:11:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:11:48,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589864412] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:11:48,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:11:48,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 13] total 39 [2022-11-02 21:11:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660318138] [2022-11-02 21:11:48,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:11:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 21:11:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 21:11:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1073, Unknown=4, NotChecked=276, Total=1482 [2022-11-02 21:11:48,987 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-11-02 21:12:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:07,514 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2022-11-02 21:12:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 21:12:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 78 [2022-11-02 21:12:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:07,517 INFO L225 Difference]: With dead ends: 261 [2022-11-02 21:12:07,517 INFO L226 Difference]: Without dead ends: 254 [2022-11-02 21:12:07,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=392, Invalid=2922, Unknown=8, NotChecked=460, Total=3782 [2022-11-02 21:12:07,520 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:07,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 268 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 861 Invalid, 0 Unknown, 743 Unchecked, 0.7s Time] [2022-11-02 21:12:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-02 21:12:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 207. [2022-11-02 21:12:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.1976047904191616) internal successors, (200), 170 states have internal predecessors, (200), 19 states have call successors, (19), 18 states have call predecessors, (19), 20 states have return successors, (28), 18 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-02 21:12:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 247 transitions. [2022-11-02 21:12:07,568 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 247 transitions. Word has length 78 [2022-11-02 21:12:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:07,568 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 247 transitions. [2022-11-02 21:12:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-11-02 21:12:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 247 transitions. [2022-11-02 21:12:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 21:12:07,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:07,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:12:07,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:12:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 21:12:07,803 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1310004315, now seen corresponding path program 1 times [2022-11-02 21:12:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:07,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508216402] [2022-11-02 21:12:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:12:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:12:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:12:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 21:12:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:12:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:12:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 21:12:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:10,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508216402] [2022-11-02 21:12:10,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508216402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:12:10,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51143773] [2022-11-02 21:12:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:10,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:12:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:12:10,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:12:10,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f384bbc5-d5a1-46d6-887f-d8cc186de4db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:12:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:10,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-02 21:12:10,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:12:10,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-02 21:12:10,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:12:10,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-02 21:12:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:12:31,569 INFO L328 TraceCheckSpWp]: Computing backward predicates...