./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:27:27,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:27:27,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:27:27,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:27:27,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:27:27,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:27:27,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:27:27,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:27:27,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:27:27,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:27:27,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:27:27,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:27:27,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:27:27,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:27:27,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:27:27,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:27:27,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:27:27,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:27:27,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:27:27,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:27:27,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:27:27,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:27:27,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:27:27,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:27:27,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:27:27,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:27:27,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:27:27,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:27:27,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:27:27,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:27:27,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:27:27,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:27:27,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:27:27,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:27:27,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:27:27,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:27:27,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:27:27,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:27:27,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:27:27,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:27:27,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:27:27,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 14:27:27,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:27:27,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:27:27,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:27:27,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:27:27,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:27:27,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:27:27,834 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:27:27,842 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:27:27,842 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:27:27,842 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:27:27,842 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:27:27,842 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:27:27,842 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:27:27,843 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:27:27,843 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:27:27,843 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:27:27,843 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:27:27,843 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:27:27,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:27:27,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:27:27,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:27:27,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:27:27,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:27:27,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:27:27,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:27:27,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:27:27,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:27:27,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:27:27,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:27:27,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:27:27,848 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_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/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_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2022-12-14 14:27:28,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:27:28,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:27:28,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:27:28,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:27:28,053 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:27:28,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-12-14 14:27:30,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:27:30,811 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:27:30,811 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-12-14 14:27:30,824 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/data/091580676/fcae7037e2454080a308e5a2f2c454cb/FLAG0f33e4773 [2022-12-14 14:27:31,164 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/data/091580676/fcae7037e2454080a308e5a2f2c454cb [2022-12-14 14:27:31,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:27:31,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:27:31,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:27:31,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:27:31,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:27:31,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f270c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31, skipping insertion in model container [2022-12-14 14:27:31,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:27:31,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:27:31,308 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 14:27:31,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-12-14 14:27:31,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-12-14 14:27:31,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-12-14 14:27:31,511 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-12-14 14:27:31,511 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-12-14 14:27:31,513 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-12-14 14:27:31,513 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-12-14 14:27:31,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:27:31,525 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:27:31,534 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 14:27:31,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-12-14 14:27:31,552 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-12-14 14:27:31,552 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-12-14 14:27:31,560 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-12-14 14:27:31,561 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-12-14 14:27:31,562 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-12-14 14:27:31,562 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-12-14 14:27:31,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:27:31,601 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:27:31,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31 WrapperNode [2022-12-14 14:27:31,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:27:31,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:27:31,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:27:31,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:27:31,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,638 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-12-14 14:27:31,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:27:31,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:27:31,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:27:31,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:27:31,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:27:31,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:27:31,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:27:31,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:27:31,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (1/1) ... [2022-12-14 14:27:31,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:27:31,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:27:31,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:27:31,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-12-14 14:27:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-12-14 14:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-12-14 14:27:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-12-14 14:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:27:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:27:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:27:31,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:27:31,725 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 14:27:31,830 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:27:31,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:27:32,121 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:27:32,128 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:27:32,129 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 14:27:32,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:27:32 BoogieIcfgContainer [2022-12-14 14:27:32,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:27:32,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:27:32,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:27:32,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:27:32,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:27:31" (1/3) ... [2022-12-14 14:27:32,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66755b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:27:32, skipping insertion in model container [2022-12-14 14:27:32,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:27:31" (2/3) ... [2022-12-14 14:27:32,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66755b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:27:32, skipping insertion in model container [2022-12-14 14:27:32,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:27:32" (3/3) ... [2022-12-14 14:27:32,136 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-12-14 14:27:32,143 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 14:27:32,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:27:32,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-14 14:27:32,150 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:27:32,214 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 14:27:32,239 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:27:32,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 233 transitions, 482 flow [2022-12-14 14:27:32,252 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 233 transitions, 482 flow [2022-12-14 14:27:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 233 transitions, 482 flow [2022-12-14 14:27:32,316 INFO L130 PetriNetUnfolder]: 17/231 cut-off events. [2022-12-14 14:27:32,316 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 14:27:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 17/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 463 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2022-12-14 14:27:32,328 INFO L119 LiptonReduction]: Number of co-enabled transitions 19012 [2022-12-14 14:27:37,447 INFO L134 LiptonReduction]: Checked pairs total: 41385 [2022-12-14 14:27:37,447 INFO L136 LiptonReduction]: Total number of compositions: 217 [2022-12-14 14:27:37,454 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 62 transitions, 140 flow [2022-12-14 14:27:37,550 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:37,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:27:37,570 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=FINITE_AUTOMATA, 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;@51ed69f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:27:37,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-12-14 14:27:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:27:37,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:37,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:27:37,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash -107019166, now seen corresponding path program 1 times [2022-12-14 14:27:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:37,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153728037] [2022-12-14 14:27:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:37,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153728037] [2022-12-14 14:27:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153728037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:37,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:27:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130619641] [2022-12-14 14:27:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:27:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:37,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:27:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:27:37,815 INFO L87 Difference]: Start difference. First operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:37,915 INFO L93 Difference]: Finished difference Result 2350 states and 7661 transitions. [2022-12-14 14:27:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:27:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 14:27:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:37,940 INFO L225 Difference]: With dead ends: 2350 [2022-12-14 14:27:37,940 INFO L226 Difference]: Without dead ends: 2348 [2022-12-14 14:27:37,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:27:37,943 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:37,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:27:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-12-14 14:27:38,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-12-14 14:27:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2344 states have (on average 3.2670648464163823) internal successors, (7658), 2347 states have internal predecessors, (7658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7658 transitions. [2022-12-14 14:27:38,043 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7658 transitions. Word has length 13 [2022-12-14 14:27:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:38,044 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 7658 transitions. [2022-12-14 14:27:38,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7658 transitions. [2022-12-14 14:27:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 14:27:38,047 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:38,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:27:38,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:27:38,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1026966621, now seen corresponding path program 1 times [2022-12-14 14:27:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210939717] [2022-12-14 14:27:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:38,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210939717] [2022-12-14 14:27:38,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210939717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:27:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888506070] [2022-12-14 14:27:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:27:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:27:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:27:38,653 INFO L87 Difference]: Start difference. First operand 2348 states and 7658 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:38,885 INFO L93 Difference]: Finished difference Result 2336 states and 7632 transitions. [2022-12-14 14:27:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:27:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 14:27:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:38,894 INFO L225 Difference]: With dead ends: 2336 [2022-12-14 14:27:38,895 INFO L226 Difference]: Without dead ends: 2336 [2022-12-14 14:27:38,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:27:38,896 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:38,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:27:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2022-12-14 14:27:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2022-12-14 14:27:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2332 states have (on average 3.272727272727273) internal successors, (7632), 2335 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7632 transitions. [2022-12-14 14:27:38,950 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 7632 transitions. Word has length 17 [2022-12-14 14:27:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:38,950 INFO L495 AbstractCegarLoop]: Abstraction has 2336 states and 7632 transitions. [2022-12-14 14:27:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 7632 transitions. [2022-12-14 14:27:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:27:38,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:38,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:27:38,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:27:38,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1183993695, now seen corresponding path program 1 times [2022-12-14 14:27:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:38,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538400337] [2022-12-14 14:27:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:39,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:39,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538400337] [2022-12-14 14:27:39,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538400337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:39,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:39,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 14:27:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816954520] [2022-12-14 14:27:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:39,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:27:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:39,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:27:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:27:39,398 INFO L87 Difference]: Start difference. First operand 2336 states and 7632 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:39,708 INFO L93 Difference]: Finished difference Result 3120 states and 10350 transitions. [2022-12-14 14:27:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:27:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 14:27:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:39,727 INFO L225 Difference]: With dead ends: 3120 [2022-12-14 14:27:39,727 INFO L226 Difference]: Without dead ends: 3109 [2022-12-14 14:27:39,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:27:39,729 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:39,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 8 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:27:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-12-14 14:27:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2909. [2022-12-14 14:27:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2905 states have (on average 3.2922547332185887) internal successors, (9564), 2908 states have internal predecessors, (9564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 9564 transitions. [2022-12-14 14:27:39,815 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 9564 transitions. Word has length 18 [2022-12-14 14:27:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:39,815 INFO L495 AbstractCegarLoop]: Abstraction has 2909 states and 9564 transitions. [2022-12-14 14:27:39,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 9564 transitions. [2022-12-14 14:27:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:27:39,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:39,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:27:39,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:27:39,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1929653445, now seen corresponding path program 2 times [2022-12-14 14:27:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:39,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491808816] [2022-12-14 14:27:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:40,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:40,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491808816] [2022-12-14 14:27:40,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491808816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:40,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:40,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 14:27:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997766946] [2022-12-14 14:27:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:40,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:27:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:40,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:27:40,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:27:40,155 INFO L87 Difference]: Start difference. First operand 2909 states and 9564 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:40,436 INFO L93 Difference]: Finished difference Result 2879 states and 9435 transitions. [2022-12-14 14:27:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:27:40,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 14:27:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:40,448 INFO L225 Difference]: With dead ends: 2879 [2022-12-14 14:27:40,448 INFO L226 Difference]: Without dead ends: 2878 [2022-12-14 14:27:40,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:27:40,449 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:40,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 8 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:27:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2022-12-14 14:27:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2829. [2022-12-14 14:27:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2825 states have (on average 3.282477876106195) internal successors, (9273), 2828 states have internal predecessors, (9273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 9273 transitions. [2022-12-14 14:27:40,512 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 9273 transitions. Word has length 18 [2022-12-14 14:27:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:40,512 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 9273 transitions. [2022-12-14 14:27:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 9273 transitions. [2022-12-14 14:27:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:40,518 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:40,518 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] [2022-12-14 14:27:40,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:27:40,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1746741434, now seen corresponding path program 1 times [2022-12-14 14:27:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:40,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571115914] [2022-12-14 14:27:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:41,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:41,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571115914] [2022-12-14 14:27:41,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571115914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:41,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:41,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:27:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698835700] [2022-12-14 14:27:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:41,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:27:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:27:41,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:27:41,258 INFO L87 Difference]: Start difference. First operand 2829 states and 9273 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:42,258 INFO L93 Difference]: Finished difference Result 3441 states and 11281 transitions. [2022-12-14 14:27:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:27:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:42,270 INFO L225 Difference]: With dead ends: 3441 [2022-12-14 14:27:42,270 INFO L226 Difference]: Without dead ends: 3441 [2022-12-14 14:27:42,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:27:42,271 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 226 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:42,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 15 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:27:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2022-12-14 14:27:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3018. [2022-12-14 14:27:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3014 states have (on average 3.295620437956204) internal successors, (9933), 3017 states have internal predecessors, (9933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 9933 transitions. [2022-12-14 14:27:42,326 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 9933 transitions. Word has length 25 [2022-12-14 14:27:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:42,326 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 9933 transitions. [2022-12-14 14:27:42,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 9933 transitions. [2022-12-14 14:27:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:42,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:42,331 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] [2022-12-14 14:27:42,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:27:42,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1168991058, now seen corresponding path program 2 times [2022-12-14 14:27:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266924026] [2022-12-14 14:27:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:43,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:43,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266924026] [2022-12-14 14:27:43,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266924026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:43,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:43,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529630459] [2022-12-14 14:27:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:43,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:43,096 INFO L87 Difference]: Start difference. First operand 3018 states and 9933 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:44,388 INFO L93 Difference]: Finished difference Result 3617 states and 11798 transitions. [2022-12-14 14:27:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:27:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:44,400 INFO L225 Difference]: With dead ends: 3617 [2022-12-14 14:27:44,400 INFO L226 Difference]: Without dead ends: 3617 [2022-12-14 14:27:44,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:27:44,401 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 245 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:44,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 32 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:27:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2022-12-14 14:27:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3446. [2022-12-14 14:27:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3442 states have (on average 3.280360255665311) internal successors, (11291), 3445 states have internal predecessors, (11291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 11291 transitions. [2022-12-14 14:27:44,490 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 11291 transitions. Word has length 25 [2022-12-14 14:27:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:44,490 INFO L495 AbstractCegarLoop]: Abstraction has 3446 states and 11291 transitions. [2022-12-14 14:27:44,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 11291 transitions. [2022-12-14 14:27:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:44,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:44,496 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] [2022-12-14 14:27:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:27:44,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1327677639, now seen corresponding path program 1 times [2022-12-14 14:27:44,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:44,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77921923] [2022-12-14 14:27:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:45,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:45,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77921923] [2022-12-14 14:27:45,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77921923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:45,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:45,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645254681] [2022-12-14 14:27:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:45,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:45,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:45,003 INFO L87 Difference]: Start difference. First operand 3446 states and 11291 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:46,045 INFO L93 Difference]: Finished difference Result 3941 states and 12776 transitions. [2022-12-14 14:27:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 14:27:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:46,057 INFO L225 Difference]: With dead ends: 3941 [2022-12-14 14:27:46,057 INFO L226 Difference]: Without dead ends: 3941 [2022-12-14 14:27:46,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:27:46,058 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 184 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:46,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 26 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:27:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-12-14 14:27:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3792. [2022-12-14 14:27:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3788 states have (on average 3.2663674762407604) internal successors, (12373), 3791 states have internal predecessors, (12373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 12373 transitions. [2022-12-14 14:27:46,121 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 12373 transitions. Word has length 25 [2022-12-14 14:27:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:46,122 INFO L495 AbstractCegarLoop]: Abstraction has 3792 states and 12373 transitions. [2022-12-14 14:27:46,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 12373 transitions. [2022-12-14 14:27:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:46,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:46,127 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] [2022-12-14 14:27:46,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:27:46,127 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1620210761, now seen corresponding path program 2 times [2022-12-14 14:27:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:46,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188286208] [2022-12-14 14:27:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:46,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:46,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188286208] [2022-12-14 14:27:46,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188286208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:46,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:46,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795641848] [2022-12-14 14:27:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:46,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:46,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:46,884 INFO L87 Difference]: Start difference. First operand 3792 states and 12373 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:47,799 INFO L93 Difference]: Finished difference Result 4062 states and 13163 transitions. [2022-12-14 14:27:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:27:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:47,809 INFO L225 Difference]: With dead ends: 4062 [2022-12-14 14:27:47,809 INFO L226 Difference]: Without dead ends: 4062 [2022-12-14 14:27:47,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:27:47,809 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:47,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 23 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:27:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-12-14 14:27:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 3936. [2022-12-14 14:27:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3932 states have (on average 3.2616988809766023) internal successors, (12825), 3935 states have internal predecessors, (12825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 12825 transitions. [2022-12-14 14:27:47,872 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 12825 transitions. Word has length 25 [2022-12-14 14:27:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:47,872 INFO L495 AbstractCegarLoop]: Abstraction has 3936 states and 12825 transitions. [2022-12-14 14:27:47,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 12825 transitions. [2022-12-14 14:27:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:47,876 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:47,876 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] [2022-12-14 14:27:47,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:27:47,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 773945926, now seen corresponding path program 3 times [2022-12-14 14:27:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156444250] [2022-12-14 14:27:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:48,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156444250] [2022-12-14 14:27:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156444250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:48,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:27:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889968775] [2022-12-14 14:27:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:27:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:27:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:27:48,447 INFO L87 Difference]: Start difference. First operand 3936 states and 12825 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:49,150 INFO L93 Difference]: Finished difference Result 3998 states and 12999 transitions. [2022-12-14 14:27:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:27:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:49,159 INFO L225 Difference]: With dead ends: 3998 [2022-12-14 14:27:49,159 INFO L226 Difference]: Without dead ends: 3998 [2022-12-14 14:27:49,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:27:49,160 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:49,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 10 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:27:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2022-12-14 14:27:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3879. [2022-12-14 14:27:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 3875 states have (on average 3.2601290322580647) internal successors, (12633), 3878 states have internal predecessors, (12633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 12633 transitions. [2022-12-14 14:27:49,238 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 12633 transitions. Word has length 25 [2022-12-14 14:27:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:49,239 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 12633 transitions. [2022-12-14 14:27:49,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 12633 transitions. [2022-12-14 14:27:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:49,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:49,244 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] [2022-12-14 14:27:49,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:27:49,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1306705678, now seen corresponding path program 4 times [2022-12-14 14:27:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:49,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626566160] [2022-12-14 14:27:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:49,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626566160] [2022-12-14 14:27:49,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626566160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:49,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:49,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:27:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404617525] [2022-12-14 14:27:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:49,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:27:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:27:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:27:49,747 INFO L87 Difference]: Start difference. First operand 3879 states and 12633 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:50,401 INFO L93 Difference]: Finished difference Result 4810 states and 15645 transitions. [2022-12-14 14:27:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:27:50,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:50,410 INFO L225 Difference]: With dead ends: 4810 [2022-12-14 14:27:50,410 INFO L226 Difference]: Without dead ends: 4810 [2022-12-14 14:27:50,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:27:50,411 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 225 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 18 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:27:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-12-14 14:27:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4059. [2022-12-14 14:27:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4055 states have (on average 3.288779284833539) internal successors, (13336), 4058 states have internal predecessors, (13336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 13336 transitions. [2022-12-14 14:27:50,476 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 13336 transitions. Word has length 25 [2022-12-14 14:27:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:50,476 INFO L495 AbstractCegarLoop]: Abstraction has 4059 states and 13336 transitions. [2022-12-14 14:27:50,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 13336 transitions. [2022-12-14 14:27:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:50,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:50,480 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] [2022-12-14 14:27:50,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:27:50,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1609026814, now seen corresponding path program 5 times [2022-12-14 14:27:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:50,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646525091] [2022-12-14 14:27:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:51,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:51,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646525091] [2022-12-14 14:27:51,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646525091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:51,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:27:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407270257] [2022-12-14 14:27:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:27:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:27:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:27:51,169 INFO L87 Difference]: Start difference. First operand 4059 states and 13336 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:52,562 INFO L93 Difference]: Finished difference Result 5367 states and 17182 transitions. [2022-12-14 14:27:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:27:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:52,570 INFO L225 Difference]: With dead ends: 5367 [2022-12-14 14:27:52,570 INFO L226 Difference]: Without dead ends: 5367 [2022-12-14 14:27:52,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:27:52,571 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 295 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 40 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:27:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-12-14 14:27:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 4059. [2022-12-14 14:27:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4055 states have (on average 3.28557336621455) internal successors, (13323), 4058 states have internal predecessors, (13323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 13323 transitions. [2022-12-14 14:27:52,634 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 13323 transitions. Word has length 25 [2022-12-14 14:27:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:52,635 INFO L495 AbstractCegarLoop]: Abstraction has 4059 states and 13323 transitions. [2022-12-14 14:27:52,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 13323 transitions. [2022-12-14 14:27:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:52,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:52,638 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] [2022-12-14 14:27:52,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:27:52,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash -205605932, now seen corresponding path program 6 times [2022-12-14 14:27:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:52,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200058549] [2022-12-14 14:27:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:52,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:53,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:53,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200058549] [2022-12-14 14:27:53,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200058549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:53,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:53,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:27:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791090280] [2022-12-14 14:27:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:27:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:27:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:27:53,125 INFO L87 Difference]: Start difference. First operand 4059 states and 13323 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:53,894 INFO L93 Difference]: Finished difference Result 4259 states and 13849 transitions. [2022-12-14 14:27:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:27:53,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:53,901 INFO L225 Difference]: With dead ends: 4259 [2022-12-14 14:27:53,902 INFO L226 Difference]: Without dead ends: 4259 [2022-12-14 14:27:53,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:27:53,902 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:53,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 26 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:27:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2022-12-14 14:27:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4107. [2022-12-14 14:27:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4103 states have (on average 3.287106994881794) internal successors, (13487), 4106 states have internal predecessors, (13487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 13487 transitions. [2022-12-14 14:27:53,981 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 13487 transitions. Word has length 25 [2022-12-14 14:27:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:53,981 INFO L495 AbstractCegarLoop]: Abstraction has 4107 states and 13487 transitions. [2022-12-14 14:27:53,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 13487 transitions. [2022-12-14 14:27:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:53,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:53,987 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] [2022-12-14 14:27:53,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:27:53,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1173628872, now seen corresponding path program 7 times [2022-12-14 14:27:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788509190] [2022-12-14 14:27:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:54,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:54,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788509190] [2022-12-14 14:27:54,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788509190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:54,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:54,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919755569] [2022-12-14 14:27:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:54,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:54,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:54,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:54,542 INFO L87 Difference]: Start difference. First operand 4107 states and 13487 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:56,053 INFO L93 Difference]: Finished difference Result 5355 states and 17213 transitions. [2022-12-14 14:27:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:27:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:56,062 INFO L225 Difference]: With dead ends: 5355 [2022-12-14 14:27:56,062 INFO L226 Difference]: Without dead ends: 5355 [2022-12-14 14:27:56,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=546, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:27:56,063 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 273 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:56,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 54 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:27:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2022-12-14 14:27:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 3939. [2022-12-14 14:27:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3935 states have (on average 3.2612452350698855) internal successors, (12833), 3938 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 12833 transitions. [2022-12-14 14:27:56,127 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 12833 transitions. Word has length 25 [2022-12-14 14:27:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:56,127 INFO L495 AbstractCegarLoop]: Abstraction has 3939 states and 12833 transitions. [2022-12-14 14:27:56,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 12833 transitions. [2022-12-14 14:27:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:56,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:56,131 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] [2022-12-14 14:27:56,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 14:27:56,131 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -441602742, now seen corresponding path program 8 times [2022-12-14 14:27:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360670723] [2022-12-14 14:27:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:56,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:56,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360670723] [2022-12-14 14:27:56,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360670723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:56,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:56,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134806518] [2022-12-14 14:27:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:56,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:56,688 INFO L87 Difference]: Start difference. First operand 3939 states and 12833 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:27:58,237 INFO L93 Difference]: Finished difference Result 4809 states and 15493 transitions. [2022-12-14 14:27:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:27:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:27:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:27:58,249 INFO L225 Difference]: With dead ends: 4809 [2022-12-14 14:27:58,249 INFO L226 Difference]: Without dead ends: 4809 [2022-12-14 14:27:58,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=588, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:27:58,250 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 199 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:27:58,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 60 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:27:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2022-12-14 14:27:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 3699. [2022-12-14 14:27:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3695 states have (on average 3.2673883626522326) internal successors, (12073), 3698 states have internal predecessors, (12073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 12073 transitions. [2022-12-14 14:27:58,310 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 12073 transitions. Word has length 25 [2022-12-14 14:27:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:27:58,310 INFO L495 AbstractCegarLoop]: Abstraction has 3699 states and 12073 transitions. [2022-12-14 14:27:58,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:27:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 12073 transitions. [2022-12-14 14:27:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:27:58,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:27:58,314 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] [2022-12-14 14:27:58,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 14:27:58,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:27:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:27:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -772037996, now seen corresponding path program 9 times [2022-12-14 14:27:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:27:58,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586623143] [2022-12-14 14:27:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:27:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:27:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:27:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:27:58,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:27:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586623143] [2022-12-14 14:27:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586623143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:27:58,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:27:58,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:27:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875798599] [2022-12-14 14:27:58,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:27:58,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:27:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:27:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:27:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:27:58,766 INFO L87 Difference]: Start difference. First operand 3699 states and 12073 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:00,319 INFO L93 Difference]: Finished difference Result 4343 states and 13890 transitions. [2022-12-14 14:28:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:28:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:00,326 INFO L225 Difference]: With dead ends: 4343 [2022-12-14 14:28:00,326 INFO L226 Difference]: Without dead ends: 4343 [2022-12-14 14:28:00,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:28:00,327 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 261 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:00,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 67 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:28:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2022-12-14 14:28:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 3473. [2022-12-14 14:28:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3469 states have (on average 3.237244162582877) internal successors, (11230), 3472 states have internal predecessors, (11230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 11230 transitions. [2022-12-14 14:28:00,386 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 11230 transitions. Word has length 25 [2022-12-14 14:28:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:00,386 INFO L495 AbstractCegarLoop]: Abstraction has 3473 states and 11230 transitions. [2022-12-14 14:28:00,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 11230 transitions. [2022-12-14 14:28:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:28:00,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:00,389 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] [2022-12-14 14:28:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 14:28:00,389 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1715545575, now seen corresponding path program 3 times [2022-12-14 14:28:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:00,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166606925] [2022-12-14 14:28:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:00,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:00,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166606925] [2022-12-14 14:28:00,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166606925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:00,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:00,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368112472] [2022-12-14 14:28:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:00,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:28:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:28:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:28:00,863 INFO L87 Difference]: Start difference. First operand 3473 states and 11230 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:01,797 INFO L93 Difference]: Finished difference Result 3862 states and 12339 transitions. [2022-12-14 14:28:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:28:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:01,804 INFO L225 Difference]: With dead ends: 3862 [2022-12-14 14:28:01,804 INFO L226 Difference]: Without dead ends: 3862 [2022-12-14 14:28:01,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-12-14 14:28:01,804 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:01,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 27 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:28:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2022-12-14 14:28:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3725. [2022-12-14 14:28:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 3721 states have (on average 3.221714592851384) internal successors, (11988), 3724 states have internal predecessors, (11988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 11988 transitions. [2022-12-14 14:28:01,856 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 11988 transitions. Word has length 25 [2022-12-14 14:28:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:01,856 INFO L495 AbstractCegarLoop]: Abstraction has 3725 states and 11988 transitions. [2022-12-14 14:28:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 11988 transitions. [2022-12-14 14:28:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:28:01,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:01,859 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] [2022-12-14 14:28:01,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 14:28:01,860 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1232342825, now seen corresponding path program 4 times [2022-12-14 14:28:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362111601] [2022-12-14 14:28:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:02,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362111601] [2022-12-14 14:28:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362111601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:28:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93744668] [2022-12-14 14:28:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:28:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:28:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:28:02,296 INFO L87 Difference]: Start difference. First operand 3725 states and 11988 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:03,289 INFO L93 Difference]: Finished difference Result 4485 states and 14218 transitions. [2022-12-14 14:28:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:28:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:03,296 INFO L225 Difference]: With dead ends: 4485 [2022-12-14 14:28:03,296 INFO L226 Difference]: Without dead ends: 4485 [2022-12-14 14:28:03,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:28:03,296 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 170 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:03,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 37 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 14:28:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2022-12-14 14:28:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 3403. [2022-12-14 14:28:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3399 states have (on average 3.2244777875845836) internal successors, (10960), 3402 states have internal predecessors, (10960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 10960 transitions. [2022-12-14 14:28:03,346 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 10960 transitions. Word has length 25 [2022-12-14 14:28:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:03,346 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 10960 transitions. [2022-12-14 14:28:03,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 10960 transitions. [2022-12-14 14:28:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:28:03,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:03,349 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] [2022-12-14 14:28:03,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 14:28:03,349 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 844860735, now seen corresponding path program 5 times [2022-12-14 14:28:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:03,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417687479] [2022-12-14 14:28:03,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:03,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:03,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417687479] [2022-12-14 14:28:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417687479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:03,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588673253] [2022-12-14 14:28:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:03,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:28:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:28:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:28:03,817 INFO L87 Difference]: Start difference. First operand 3403 states and 10960 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:04,494 INFO L93 Difference]: Finished difference Result 3494 states and 11235 transitions. [2022-12-14 14:28:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:28:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:04,500 INFO L225 Difference]: With dead ends: 3494 [2022-12-14 14:28:04,500 INFO L226 Difference]: Without dead ends: 3494 [2022-12-14 14:28:04,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:28:04,501 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:04,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 34 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:28:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2022-12-14 14:28:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2022-12-14 14:28:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 3490 states have (on average 3.21919770773639) internal successors, (11235), 3493 states have internal predecessors, (11235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 11235 transitions. [2022-12-14 14:28:04,549 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 11235 transitions. Word has length 25 [2022-12-14 14:28:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:04,550 INFO L495 AbstractCegarLoop]: Abstraction has 3494 states and 11235 transitions. [2022-12-14 14:28:04,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 11235 transitions. [2022-12-14 14:28:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:28:04,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:04,553 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] [2022-12-14 14:28:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 14:28:04,553 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2103027665, now seen corresponding path program 6 times [2022-12-14 14:28:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:04,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555294300] [2022-12-14 14:28:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:04,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:04,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555294300] [2022-12-14 14:28:04,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555294300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:04,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:04,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:28:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901189788] [2022-12-14 14:28:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:28:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:28:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:28:04,968 INFO L87 Difference]: Start difference. First operand 3494 states and 11235 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:06,112 INFO L93 Difference]: Finished difference Result 4194 states and 13345 transitions. [2022-12-14 14:28:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:06,119 INFO L225 Difference]: With dead ends: 4194 [2022-12-14 14:28:06,119 INFO L226 Difference]: Without dead ends: 4194 [2022-12-14 14:28:06,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:06,120 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 205 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:06,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 39 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:28:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2022-12-14 14:28:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 3263. [2022-12-14 14:28:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3263 states, 3259 states have (on average 3.2341208959803622) internal successors, (10540), 3262 states have internal predecessors, (10540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 10540 transitions. [2022-12-14 14:28:06,165 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 10540 transitions. Word has length 25 [2022-12-14 14:28:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:06,165 INFO L495 AbstractCegarLoop]: Abstraction has 3263 states and 10540 transitions. [2022-12-14 14:28:06,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 10540 transitions. [2022-12-14 14:28:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:28:06,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:06,167 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] [2022-12-14 14:28:06,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 14:28:06,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 880925061, now seen corresponding path program 7 times [2022-12-14 14:28:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401283755] [2022-12-14 14:28:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:06,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:06,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401283755] [2022-12-14 14:28:06,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401283755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:06,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:06,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:28:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240304597] [2022-12-14 14:28:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:06,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:28:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:06,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:28:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:28:06,632 INFO L87 Difference]: Start difference. First operand 3263 states and 10540 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:08,042 INFO L93 Difference]: Finished difference Result 4047 states and 12847 transitions. [2022-12-14 14:28:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:28:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 14:28:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:08,049 INFO L225 Difference]: With dead ends: 4047 [2022-12-14 14:28:08,049 INFO L226 Difference]: Without dead ends: 4047 [2022-12-14 14:28:08,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:08,050 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 198 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:08,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 49 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:28:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2022-12-14 14:28:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3137. [2022-12-14 14:28:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3133 states have (on average 3.219597829556336) internal successors, (10087), 3136 states have internal predecessors, (10087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 10087 transitions. [2022-12-14 14:28:08,109 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 10087 transitions. Word has length 25 [2022-12-14 14:28:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:08,109 INFO L495 AbstractCegarLoop]: Abstraction has 3137 states and 10087 transitions. [2022-12-14 14:28:08,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 10087 transitions. [2022-12-14 14:28:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:08,111 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:08,111 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] [2022-12-14 14:28:08,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 14:28:08,112 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1575725538, now seen corresponding path program 1 times [2022-12-14 14:28:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:08,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818973022] [2022-12-14 14:28:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:08,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818973022] [2022-12-14 14:28:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818973022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:08,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:28:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028718584] [2022-12-14 14:28:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:28:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:28:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:28:08,928 INFO L87 Difference]: Start difference. First operand 3137 states and 10087 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:10,463 INFO L93 Difference]: Finished difference Result 5085 states and 16476 transitions. [2022-12-14 14:28:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:10,472 INFO L225 Difference]: With dead ends: 5085 [2022-12-14 14:28:10,472 INFO L226 Difference]: Without dead ends: 5085 [2022-12-14 14:28:10,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:10,472 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 287 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:10,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 48 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2022-12-14 14:28:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 3751. [2022-12-14 14:28:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3747 states have (on average 3.2228449426207635) internal successors, (12076), 3750 states have internal predecessors, (12076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 12076 transitions. [2022-12-14 14:28:10,536 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 12076 transitions. Word has length 27 [2022-12-14 14:28:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:10,536 INFO L495 AbstractCegarLoop]: Abstraction has 3751 states and 12076 transitions. [2022-12-14 14:28:10,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 12076 transitions. [2022-12-14 14:28:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:10,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:10,539 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] [2022-12-14 14:28:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 14:28:10,539 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 698467782, now seen corresponding path program 2 times [2022-12-14 14:28:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186744443] [2022-12-14 14:28:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:11,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:11,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186744443] [2022-12-14 14:28:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186744443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:11,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:11,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125294990] [2022-12-14 14:28:11,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:11,213 INFO L87 Difference]: Start difference. First operand 3751 states and 12076 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:12,321 INFO L93 Difference]: Finished difference Result 6035 states and 19629 transitions. [2022-12-14 14:28:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:12,331 INFO L225 Difference]: With dead ends: 6035 [2022-12-14 14:28:12,331 INFO L226 Difference]: Without dead ends: 6035 [2022-12-14 14:28:12,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:12,332 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 347 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:12,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 72 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:28:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2022-12-14 14:28:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 4465. [2022-12-14 14:28:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4461 states have (on average 3.2158708809683927) internal successors, (14346), 4464 states have internal predecessors, (14346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 14346 transitions. [2022-12-14 14:28:12,399 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 14346 transitions. Word has length 27 [2022-12-14 14:28:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 4465 states and 14346 transitions. [2022-12-14 14:28:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 14346 transitions. [2022-12-14 14:28:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:12,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:12,410 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] [2022-12-14 14:28:12,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 14:28:12,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1963830325, now seen corresponding path program 1 times [2022-12-14 14:28:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685391114] [2022-12-14 14:28:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:13,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:13,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685391114] [2022-12-14 14:28:13,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685391114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:13,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153623418] [2022-12-14 14:28:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:13,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:28:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:28:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:28:13,134 INFO L87 Difference]: Start difference. First operand 4465 states and 14346 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:14,397 INFO L93 Difference]: Finished difference Result 6661 states and 21607 transitions. [2022-12-14 14:28:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:28:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:14,409 INFO L225 Difference]: With dead ends: 6661 [2022-12-14 14:28:14,409 INFO L226 Difference]: Without dead ends: 6661 [2022-12-14 14:28:14,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:28:14,409 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 301 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:14,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 61 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:28:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2022-12-14 14:28:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5069. [2022-12-14 14:28:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 5065 states have (on average 3.2017769002961503) internal successors, (16217), 5068 states have internal predecessors, (16217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 16217 transitions. [2022-12-14 14:28:14,484 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 16217 transitions. Word has length 27 [2022-12-14 14:28:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:14,484 INFO L495 AbstractCegarLoop]: Abstraction has 5069 states and 16217 transitions. [2022-12-14 14:28:14,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 16217 transitions. [2022-12-14 14:28:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:14,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:14,489 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] [2022-12-14 14:28:14,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 14:28:14,489 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -391840970, now seen corresponding path program 3 times [2022-12-14 14:28:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:14,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291219426] [2022-12-14 14:28:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:15,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:15,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291219426] [2022-12-14 14:28:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291219426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:15,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:28:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122365506] [2022-12-14 14:28:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:15,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:28:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:28:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:28:15,277 INFO L87 Difference]: Start difference. First operand 5069 states and 16217 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:16,766 INFO L93 Difference]: Finished difference Result 7287 states and 23416 transitions. [2022-12-14 14:28:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:16,779 INFO L225 Difference]: With dead ends: 7287 [2022-12-14 14:28:16,779 INFO L226 Difference]: Without dead ends: 7287 [2022-12-14 14:28:16,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:16,779 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 298 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:16,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 58 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2022-12-14 14:28:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 5249. [2022-12-14 14:28:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5249 states, 5245 states have (on average 3.1948522402287893) internal successors, (16757), 5248 states have internal predecessors, (16757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 16757 transitions. [2022-12-14 14:28:16,865 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 16757 transitions. Word has length 27 [2022-12-14 14:28:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:16,865 INFO L495 AbstractCegarLoop]: Abstraction has 5249 states and 16757 transitions. [2022-12-14 14:28:16,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 16757 transitions. [2022-12-14 14:28:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:16,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:16,870 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] [2022-12-14 14:28:16,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 14:28:16,870 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1269098726, now seen corresponding path program 4 times [2022-12-14 14:28:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:16,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124185406] [2022-12-14 14:28:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:17,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:17,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124185406] [2022-12-14 14:28:17,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124185406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:17,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:17,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310721045] [2022-12-14 14:28:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:17,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:17,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:17,474 INFO L87 Difference]: Start difference. First operand 5249 states and 16757 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:18,718 INFO L93 Difference]: Finished difference Result 8197 states and 26449 transitions. [2022-12-14 14:28:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:18,731 INFO L225 Difference]: With dead ends: 8197 [2022-12-14 14:28:18,731 INFO L226 Difference]: Without dead ends: 8197 [2022-12-14 14:28:18,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:18,732 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 351 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:18,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 81 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:28:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8197 states. [2022-12-14 14:28:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8197 to 5309. [2022-12-14 14:28:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5305 states have (on average 3.1926484448633365) internal successors, (16937), 5308 states have internal predecessors, (16937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 16937 transitions. [2022-12-14 14:28:18,810 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 16937 transitions. Word has length 27 [2022-12-14 14:28:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:18,810 INFO L495 AbstractCegarLoop]: Abstraction has 5309 states and 16937 transitions. [2022-12-14 14:28:18,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 16937 transitions. [2022-12-14 14:28:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:18,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:18,815 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] [2022-12-14 14:28:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 14:28:18,816 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2024352132, now seen corresponding path program 5 times [2022-12-14 14:28:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604259102] [2022-12-14 14:28:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:19,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604259102] [2022-12-14 14:28:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604259102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:19,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:19,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:28:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225730413] [2022-12-14 14:28:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:19,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:28:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:28:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:28:19,600 INFO L87 Difference]: Start difference. First operand 5309 states and 16937 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:20,982 INFO L93 Difference]: Finished difference Result 6841 states and 22146 transitions. [2022-12-14 14:28:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:20,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:20,994 INFO L225 Difference]: With dead ends: 6841 [2022-12-14 14:28:20,994 INFO L226 Difference]: Without dead ends: 6841 [2022-12-14 14:28:20,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:20,994 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 270 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:20,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 51 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:28:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6841 states. [2022-12-14 14:28:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6841 to 5705. [2022-12-14 14:28:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 3.220838449394843) internal successors, (18362), 5704 states have internal predecessors, (18362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 18362 transitions. [2022-12-14 14:28:21,074 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 18362 transitions. Word has length 27 [2022-12-14 14:28:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:21,074 INFO L495 AbstractCegarLoop]: Abstraction has 5705 states and 18362 transitions. [2022-12-14 14:28:21,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 18362 transitions. [2022-12-14 14:28:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:21,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:21,079 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] [2022-12-14 14:28:21,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 14:28:21,080 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2024352131, now seen corresponding path program 1 times [2022-12-14 14:28:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:21,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668175856] [2022-12-14 14:28:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:21,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668175856] [2022-12-14 14:28:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668175856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:21,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:28:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129491599] [2022-12-14 14:28:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:21,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:28:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:28:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:28:21,809 INFO L87 Difference]: Start difference. First operand 5705 states and 18362 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:23,165 INFO L93 Difference]: Finished difference Result 6751 states and 21808 transitions. [2022-12-14 14:28:23,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:23,177 INFO L225 Difference]: With dead ends: 6751 [2022-12-14 14:28:23,177 INFO L226 Difference]: Without dead ends: 6751 [2022-12-14 14:28:23,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:23,177 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 315 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:23,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 58 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:28:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2022-12-14 14:28:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 5181. [2022-12-14 14:28:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5177 states have (on average 3.197411628356191) internal successors, (16553), 5180 states have internal predecessors, (16553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 16553 transitions. [2022-12-14 14:28:23,254 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 16553 transitions. Word has length 27 [2022-12-14 14:28:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:23,255 INFO L495 AbstractCegarLoop]: Abstraction has 5181 states and 16553 transitions. [2022-12-14 14:28:23,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 16553 transitions. [2022-12-14 14:28:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:23,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:23,266 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] [2022-12-14 14:28:23,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 14:28:23,266 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1393357408, now seen corresponding path program 6 times [2022-12-14 14:28:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:23,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990875132] [2022-12-14 14:28:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:23,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:23,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990875132] [2022-12-14 14:28:23,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990875132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:23,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:23,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81460263] [2022-12-14 14:28:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:23,853 INFO L87 Difference]: Start difference. First operand 5181 states and 16553 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:25,319 INFO L93 Difference]: Finished difference Result 8189 states and 26425 transitions. [2022-12-14 14:28:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:25,334 INFO L225 Difference]: With dead ends: 8189 [2022-12-14 14:28:25,334 INFO L226 Difference]: Without dead ends: 8189 [2022-12-14 14:28:25,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:25,334 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 334 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:25,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 89 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2022-12-14 14:28:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 5073. [2022-12-14 14:28:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 5069 states have (on average 3.2016176760702306) internal successors, (16229), 5072 states have internal predecessors, (16229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 16229 transitions. [2022-12-14 14:28:25,423 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 16229 transitions. Word has length 27 [2022-12-14 14:28:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:25,423 INFO L495 AbstractCegarLoop]: Abstraction has 5073 states and 16229 transitions. [2022-12-14 14:28:25,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 16229 transitions. [2022-12-14 14:28:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:25,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:25,427 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] [2022-12-14 14:28:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 14:28:25,427 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -361029790, now seen corresponding path program 7 times [2022-12-14 14:28:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146119153] [2022-12-14 14:28:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:26,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:26,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146119153] [2022-12-14 14:28:26,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146119153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:26,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:26,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702635012] [2022-12-14 14:28:26,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:26,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:26,059 INFO L87 Difference]: Start difference. First operand 5073 states and 16229 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:27,553 INFO L93 Difference]: Finished difference Result 7219 states and 23340 transitions. [2022-12-14 14:28:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:27,566 INFO L225 Difference]: With dead ends: 7219 [2022-12-14 14:28:27,566 INFO L226 Difference]: Without dead ends: 7219 [2022-12-14 14:28:27,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:27,566 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 344 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:27,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 81 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:28:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7219 states. [2022-12-14 14:28:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7219 to 4713. [2022-12-14 14:28:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4713 states, 4709 states have (on average 3.2170312168188575) internal successors, (15149), 4712 states have internal predecessors, (15149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 15149 transitions. [2022-12-14 14:28:27,646 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 15149 transitions. Word has length 27 [2022-12-14 14:28:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:27,646 INFO L495 AbstractCegarLoop]: Abstraction has 4713 states and 15149 transitions. [2022-12-14 14:28:27,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 15149 transitions. [2022-12-14 14:28:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:27,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:27,650 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] [2022-12-14 14:28:27,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 14:28:27,650 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash -81728980, now seen corresponding path program 8 times [2022-12-14 14:28:27,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189428429] [2022-12-14 14:28:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:28,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:28,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189428429] [2022-12-14 14:28:28,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189428429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:28,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:28,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603580493] [2022-12-14 14:28:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:28,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:28,332 INFO L87 Difference]: Start difference. First operand 4713 states and 15149 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:29,811 INFO L93 Difference]: Finished difference Result 6619 states and 21540 transitions. [2022-12-14 14:28:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:29,823 INFO L225 Difference]: With dead ends: 6619 [2022-12-14 14:28:29,823 INFO L226 Difference]: Without dead ends: 6619 [2022-12-14 14:28:29,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-12-14 14:28:29,824 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 315 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:29,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 83 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2022-12-14 14:28:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4593. [2022-12-14 14:28:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4589 states have (on average 3.2227064719982565) internal successors, (14789), 4592 states have internal predecessors, (14789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 14789 transitions. [2022-12-14 14:28:29,891 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 14789 transitions. Word has length 27 [2022-12-14 14:28:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:29,891 INFO L495 AbstractCegarLoop]: Abstraction has 4593 states and 14789 transitions. [2022-12-14 14:28:29,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 14789 transitions. [2022-12-14 14:28:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:29,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:29,895 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] [2022-12-14 14:28:29,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 14:28:29,895 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -528443564, now seen corresponding path program 9 times [2022-12-14 14:28:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:29,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218134956] [2022-12-14 14:28:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:30,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218134956] [2022-12-14 14:28:30,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218134956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:30,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 14:28:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615344625] [2022-12-14 14:28:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:30,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:28:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:28:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:28:30,535 INFO L87 Difference]: Start difference. First operand 4593 states and 14789 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:32,325 INFO L93 Difference]: Finished difference Result 6566 states and 21406 transitions. [2022-12-14 14:28:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:32,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:32,337 INFO L225 Difference]: With dead ends: 6566 [2022-12-14 14:28:32,337 INFO L226 Difference]: Without dead ends: 6566 [2022-12-14 14:28:32,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:28:32,338 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 318 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:32,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 86 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:28:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2022-12-14 14:28:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 4474. [2022-12-14 14:28:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4470 states have (on average 3.2248322147651005) internal successors, (14415), 4473 states have internal predecessors, (14415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 14415 transitions. [2022-12-14 14:28:32,406 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 14415 transitions. Word has length 27 [2022-12-14 14:28:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:32,406 INFO L495 AbstractCegarLoop]: Abstraction has 4474 states and 14415 transitions. [2022-12-14 14:28:32,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 14415 transitions. [2022-12-14 14:28:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:32,409 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:32,409 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] [2022-12-14 14:28:32,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 14:28:32,409 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1410068715, now seen corresponding path program 2 times [2022-12-14 14:28:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:32,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986613394] [2022-12-14 14:28:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:33,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:33,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986613394] [2022-12-14 14:28:33,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986613394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:33,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:33,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318068440] [2022-12-14 14:28:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:28:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:28:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:28:33,193 INFO L87 Difference]: Start difference. First operand 4474 states and 14415 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:34,720 INFO L93 Difference]: Finished difference Result 6554 states and 21328 transitions. [2022-12-14 14:28:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:28:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:34,732 INFO L225 Difference]: With dead ends: 6554 [2022-12-14 14:28:34,732 INFO L226 Difference]: Without dead ends: 6554 [2022-12-14 14:28:34,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:28:34,732 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 275 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:34,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 72 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:28:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2022-12-14 14:28:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 4348. [2022-12-14 14:28:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4348 states, 4344 states have (on average 3.231353591160221) internal successors, (14037), 4347 states have internal predecessors, (14037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 14037 transitions. [2022-12-14 14:28:34,801 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 14037 transitions. Word has length 27 [2022-12-14 14:28:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:34,801 INFO L495 AbstractCegarLoop]: Abstraction has 4348 states and 14037 transitions. [2022-12-14 14:28:34,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 14037 transitions. [2022-12-14 14:28:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:34,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:34,804 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] [2022-12-14 14:28:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 14:28:34,805 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2094407101, now seen corresponding path program 3 times [2022-12-14 14:28:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:34,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699868725] [2022-12-14 14:28:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:35,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:35,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699868725] [2022-12-14 14:28:35,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699868725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:35,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:35,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:28:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427725960] [2022-12-14 14:28:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 14:28:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 14:28:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:28:35,664 INFO L87 Difference]: Start difference. First operand 4348 states and 14037 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:36,952 INFO L93 Difference]: Finished difference Result 5852 states and 19094 transitions. [2022-12-14 14:28:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:28:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:36,964 INFO L225 Difference]: With dead ends: 5852 [2022-12-14 14:28:36,964 INFO L226 Difference]: Without dead ends: 5852 [2022-12-14 14:28:36,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:28:36,965 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 297 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:36,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 57 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:28:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2022-12-14 14:28:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 4330. [2022-12-14 14:28:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4326 states have (on average 3.2323162274618586) internal successors, (13983), 4329 states have internal predecessors, (13983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 13983 transitions. [2022-12-14 14:28:37,039 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 13983 transitions. Word has length 27 [2022-12-14 14:28:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:37,039 INFO L495 AbstractCegarLoop]: Abstraction has 4330 states and 13983 transitions. [2022-12-14 14:28:37,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 13983 transitions. [2022-12-14 14:28:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:37,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:37,053 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] [2022-12-14 14:28:37,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 14:28:37,053 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1539958635, now seen corresponding path program 4 times [2022-12-14 14:28:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:37,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619746198] [2022-12-14 14:28:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:37,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:37,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619746198] [2022-12-14 14:28:37,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619746198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:37,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:37,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925239552] [2022-12-14 14:28:37,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:37,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:28:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:28:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:28:37,744 INFO L87 Difference]: Start difference. First operand 4330 states and 13983 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:39,066 INFO L93 Difference]: Finished difference Result 6912 states and 22577 transitions. [2022-12-14 14:28:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:28:39,066 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:39,083 INFO L225 Difference]: With dead ends: 6912 [2022-12-14 14:28:39,083 INFO L226 Difference]: Without dead ends: 6912 [2022-12-14 14:28:39,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:28:39,083 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 285 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:39,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 72 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2022-12-14 14:28:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 4168. [2022-12-14 14:28:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4164 states have (on average 3.2413544668587897) internal successors, (13497), 4167 states have internal predecessors, (13497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 13497 transitions. [2022-12-14 14:28:39,161 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 13497 transitions. Word has length 27 [2022-12-14 14:28:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:39,162 INFO L495 AbstractCegarLoop]: Abstraction has 4168 states and 13497 transitions. [2022-12-14 14:28:39,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 13497 transitions. [2022-12-14 14:28:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:39,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:39,164 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] [2022-12-14 14:28:39,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 14:28:39,165 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1195901119, now seen corresponding path program 5 times [2022-12-14 14:28:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:39,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146602323] [2022-12-14 14:28:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:39,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:39,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146602323] [2022-12-14 14:28:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146602323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:39,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:39,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459233056] [2022-12-14 14:28:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:28:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:28:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:28:39,768 INFO L87 Difference]: Start difference. First operand 4168 states and 13497 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:41,033 INFO L93 Difference]: Finished difference Result 6074 states and 19888 transitions. [2022-12-14 14:28:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:28:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:41,045 INFO L225 Difference]: With dead ends: 6074 [2022-12-14 14:28:41,045 INFO L226 Difference]: Without dead ends: 6074 [2022-12-14 14:28:41,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:28:41,046 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 276 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:41,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 71 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:28:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-12-14 14:28:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 4108. [2022-12-14 14:28:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4104 states have (on average 3.2448830409356724) internal successors, (13317), 4107 states have internal predecessors, (13317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 13317 transitions. [2022-12-14 14:28:41,116 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 13317 transitions. Word has length 27 [2022-12-14 14:28:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 4108 states and 13317 transitions. [2022-12-14 14:28:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 13317 transitions. [2022-12-14 14:28:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:28:41,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:41,119 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] [2022-12-14 14:28:41,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 14:28:41,120 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1934178209, now seen corresponding path program 6 times [2022-12-14 14:28:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:41,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018151044] [2022-12-14 14:28:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:41,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-12-14 14:28:41,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:41,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018151044] [2022-12-14 14:28:41,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018151044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:28:41,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:28:41,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:28:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211782041] [2022-12-14 14:28:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:28:41,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:28:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:28:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:28:41,682 INFO L87 Difference]: Start difference. First operand 4108 states and 13317 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:43,015 INFO L93 Difference]: Finished difference Result 6081 states and 19934 transitions. [2022-12-14 14:28:43,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:28:43,015 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 14:28:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:43,027 INFO L225 Difference]: With dead ends: 6081 [2022-12-14 14:28:43,027 INFO L226 Difference]: Without dead ends: 6081 [2022-12-14 14:28:43,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:28:43,027 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 299 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:43,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 74 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 14:28:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2022-12-14 14:28:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3988. [2022-12-14 14:28:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3984 states have (on average 3.2484939759036147) internal successors, (12942), 3987 states have internal predecessors, (12942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 12942 transitions. [2022-12-14 14:28:43,102 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 12942 transitions. Word has length 27 [2022-12-14 14:28:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:43,102 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 12942 transitions. [2022-12-14 14:28:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 12942 transitions. [2022-12-14 14:28:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:28:43,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:43,105 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] [2022-12-14 14:28:43,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 14:28:43,106 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2010630767, now seen corresponding path program 1 times [2022-12-14 14:28:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270513865] [2022-12-14 14:28:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:43,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270513865] [2022-12-14 14:28:43,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270513865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:28:43,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056760171] [2022-12-14 14:28:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:28:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:28:43,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:28:43,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:28:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:43,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 14:28:43,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:28:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:43,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:28:43,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:28:43,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:28:44,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:28:44,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:28:44,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:44,294 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:28:44,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 14:28:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:44,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:44,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:28:44,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 14:28:44,503 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 14:28:44,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 14:28:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:44,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:28:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:47,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056760171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:28:47,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1763525897] [2022-12-14 14:28:47,571 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:28:47,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:28:47,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 38 [2022-12-14 14:28:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675060155] [2022-12-14 14:28:47,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:28:47,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 14:28:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:47,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 14:28:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1408, Unknown=16, NotChecked=0, Total=1560 [2022-12-14 14:28:47,575 INFO L87 Difference]: Start difference. First operand 3988 states and 12942 transitions. Second operand has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:28:53,250 INFO L93 Difference]: Finished difference Result 6822 states and 22511 transitions. [2022-12-14 14:28:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:28:53,251 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 14:28:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:28:53,265 INFO L225 Difference]: With dead ends: 6822 [2022-12-14 14:28:53,265 INFO L226 Difference]: Without dead ends: 6822 [2022-12-14 14:28:53,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=431, Invalid=2745, Unknown=16, NotChecked=0, Total=3192 [2022-12-14 14:28:53,266 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 837 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 5782 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 5804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:28:53,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 215 Invalid, 5804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5782 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 14:28:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2022-12-14 14:28:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 4094. [2022-12-14 14:28:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 4090 states have (on average 3.249877750611247) internal successors, (13292), 4093 states have internal predecessors, (13292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 13292 transitions. [2022-12-14 14:28:53,337 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 13292 transitions. Word has length 29 [2022-12-14 14:28:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:28:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 4094 states and 13292 transitions. [2022-12-14 14:28:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1794871794871793) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:28:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 13292 transitions. [2022-12-14 14:28:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 14:28:53,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:28:53,340 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] [2022-12-14 14:28:53,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:28:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 14:28:53,542 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:28:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:28:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash -190739424, now seen corresponding path program 1 times [2022-12-14 14:28:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:28:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408919005] [2022-12-14 14:28:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:28:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:54,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:28:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408919005] [2022-12-14 14:28:54,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408919005] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:28:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371582651] [2022-12-14 14:28:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:28:54,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:28:54,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:28:54,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:28:54,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:28:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:28:54,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 14:28:54,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:28:54,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:54,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:28:54,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:54,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:28:54,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:28:54,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:28:54,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:28:54,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:54,749 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:28:54,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 14:28:54,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:28:54,814 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-14 14:28:54,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 41 [2022-12-14 14:28:54,975 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 14:28:54,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 14:28:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:54,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:28:56,822 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1142 Int)) (or (< v_ArrVal_1141 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1139))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse3) 4)) v_ArrVal_1141)) .cse3 v_ArrVal_1142)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))))) is different from false [2022-12-14 14:28:56,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1142 Int)) (or (< v_ArrVal_1141 1) (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse1) 4)) v_ArrVal_1141)))) (select (store .cse0 .cse1 v_ArrVal_1142) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))))) is different from false [2022-12-14 14:28:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:28:56,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371582651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:28:56,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472205660] [2022-12-14 14:28:56,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:28:56,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:28:56,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 35 [2022-12-14 14:28:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391770666] [2022-12-14 14:28:56,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:28:56,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 14:28:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:28:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 14:28:56,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1073, Unknown=2, NotChecked=134, Total=1332 [2022-12-14 14:28:56,838 INFO L87 Difference]: Start difference. First operand 4094 states and 13292 transitions. Second operand has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:00,912 INFO L93 Difference]: Finished difference Result 6990 states and 23053 transitions. [2022-12-14 14:29:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 14:29:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 14:29:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:00,926 INFO L225 Difference]: With dead ends: 6990 [2022-12-14 14:29:00,926 INFO L226 Difference]: Without dead ends: 6990 [2022-12-14 14:29:00,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=391, Invalid=2165, Unknown=2, NotChecked=198, Total=2756 [2022-12-14 14:29:00,927 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 668 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 3759 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:00,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 129 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3759 Invalid, 0 Unknown, 523 Unchecked, 3.0s Time] [2022-12-14 14:29:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2022-12-14 14:29:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 4102. [2022-12-14 14:29:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4098 states have (on average 3.2489019033674964) internal successors, (13314), 4101 states have internal predecessors, (13314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13314 transitions. [2022-12-14 14:29:00,997 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13314 transitions. Word has length 29 [2022-12-14 14:29:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 4102 states and 13314 transitions. [2022-12-14 14:29:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13314 transitions. [2022-12-14 14:29:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:01,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:01,000 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-12-14 14:29:01,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:29:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 14:29:01,202 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1553175951, now seen corresponding path program 1 times [2022-12-14 14:29:01,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:01,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440369403] [2022-12-14 14:29:01,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:01,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:01,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440369403] [2022-12-14 14:29:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440369403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:01,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:01,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:29:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323736913] [2022-12-14 14:29:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:01,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:29:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:29:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:29:01,652 INFO L87 Difference]: Start difference. First operand 4102 states and 13314 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:02,742 INFO L93 Difference]: Finished difference Result 10384 states and 34165 transitions. [2022-12-14 14:29:02,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:29:02,743 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:02,761 INFO L225 Difference]: With dead ends: 10384 [2022-12-14 14:29:02,761 INFO L226 Difference]: Without dead ends: 10384 [2022-12-14 14:29:02,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-12-14 14:29:02,762 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 365 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:02,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 34 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:29:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2022-12-14 14:29:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 8765. [2022-12-14 14:29:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8761 states have (on average 3.3247346193356924) internal successors, (29128), 8764 states have internal predecessors, (29128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 29128 transitions. [2022-12-14 14:29:02,919 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 29128 transitions. Word has length 30 [2022-12-14 14:29:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:02,919 INFO L495 AbstractCegarLoop]: Abstraction has 8765 states and 29128 transitions. [2022-12-14 14:29:02,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 29128 transitions. [2022-12-14 14:29:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:02,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:02,925 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-12-14 14:29:02,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 14:29:02,925 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:02,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1575160808, now seen corresponding path program 1 times [2022-12-14 14:29:02,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:02,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395015658] [2022-12-14 14:29:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:03,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:03,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395015658] [2022-12-14 14:29:03,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395015658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:03,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:03,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:29:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435984974] [2022-12-14 14:29:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:03,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:29:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:29:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:29:03,303 INFO L87 Difference]: Start difference. First operand 8765 states and 29128 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:04,439 INFO L93 Difference]: Finished difference Result 14727 states and 48773 transitions. [2022-12-14 14:29:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:29:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:04,468 INFO L225 Difference]: With dead ends: 14727 [2022-12-14 14:29:04,468 INFO L226 Difference]: Without dead ends: 14727 [2022-12-14 14:29:04,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:29:04,469 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 323 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:04,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 25 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:29:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14727 states. [2022-12-14 14:29:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14727 to 11395. [2022-12-14 14:29:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11395 states, 11391 states have (on average 3.348871916425248) internal successors, (38147), 11394 states have internal predecessors, (38147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11395 states to 11395 states and 38147 transitions. [2022-12-14 14:29:04,678 INFO L78 Accepts]: Start accepts. Automaton has 11395 states and 38147 transitions. Word has length 30 [2022-12-14 14:29:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:04,678 INFO L495 AbstractCegarLoop]: Abstraction has 11395 states and 38147 transitions. [2022-12-14 14:29:04,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 11395 states and 38147 transitions. [2022-12-14 14:29:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:04,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:04,688 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-12-14 14:29:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-14 14:29:04,689 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 386640029, now seen corresponding path program 2 times [2022-12-14 14:29:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:04,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680449496] [2022-12-14 14:29:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:05,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680449496] [2022-12-14 14:29:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680449496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:05,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:05,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:29:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934678485] [2022-12-14 14:29:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:29:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:29:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:29:05,014 INFO L87 Difference]: Start difference. First operand 11395 states and 38147 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:06,225 INFO L93 Difference]: Finished difference Result 19245 states and 64051 transitions. [2022-12-14 14:29:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:29:06,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:06,265 INFO L225 Difference]: With dead ends: 19245 [2022-12-14 14:29:06,265 INFO L226 Difference]: Without dead ends: 19245 [2022-12-14 14:29:06,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-12-14 14:29:06,265 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 487 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:06,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 46 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 14:29:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19245 states. [2022-12-14 14:29:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19245 to 12267. [2022-12-14 14:29:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12267 states, 12263 states have (on average 3.348935823208024) internal successors, (41068), 12266 states have internal predecessors, (41068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12267 states to 12267 states and 41068 transitions. [2022-12-14 14:29:06,509 INFO L78 Accepts]: Start accepts. Automaton has 12267 states and 41068 transitions. Word has length 30 [2022-12-14 14:29:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:06,509 INFO L495 AbstractCegarLoop]: Abstraction has 12267 states and 41068 transitions. [2022-12-14 14:29:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12267 states and 41068 transitions. [2022-12-14 14:29:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:06,549 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:06,549 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-12-14 14:29:06,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-14 14:29:06,550 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1838694505, now seen corresponding path program 3 times [2022-12-14 14:29:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:06,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524634503] [2022-12-14 14:29:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:06,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:06,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524634503] [2022-12-14 14:29:06,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524634503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:06,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:06,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:29:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203666375] [2022-12-14 14:29:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:06,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:29:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:29:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:29:06,874 INFO L87 Difference]: Start difference. First operand 12267 states and 41068 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:08,304 INFO L93 Difference]: Finished difference Result 21615 states and 72280 transitions. [2022-12-14 14:29:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:29:08,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:08,361 INFO L225 Difference]: With dead ends: 21615 [2022-12-14 14:29:08,361 INFO L226 Difference]: Without dead ends: 21615 [2022-12-14 14:29:08,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:29:08,362 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 496 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:08,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 80 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 14:29:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21615 states. [2022-12-14 14:29:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21615 to 12529. [2022-12-14 14:29:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12529 states, 12525 states have (on average 3.3649500998003994) internal successors, (42146), 12528 states have internal predecessors, (42146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12529 states to 12529 states and 42146 transitions. [2022-12-14 14:29:08,659 INFO L78 Accepts]: Start accepts. Automaton has 12529 states and 42146 transitions. Word has length 30 [2022-12-14 14:29:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:08,659 INFO L495 AbstractCegarLoop]: Abstraction has 12529 states and 42146 transitions. [2022-12-14 14:29:08,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12529 states and 42146 transitions. [2022-12-14 14:29:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:08,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:08,672 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-12-14 14:29:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-14 14:29:08,672 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -840497935, now seen corresponding path program 4 times [2022-12-14 14:29:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:08,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047133030] [2022-12-14 14:29:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:09,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047133030] [2022-12-14 14:29:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047133030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:09,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:09,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 14:29:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279024945] [2022-12-14 14:29:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:09,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:29:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:29:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:29:09,014 INFO L87 Difference]: Start difference. First operand 12529 states and 42146 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:10,780 INFO L93 Difference]: Finished difference Result 21410 states and 72049 transitions. [2022-12-14 14:29:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:29:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:10,821 INFO L225 Difference]: With dead ends: 21410 [2022-12-14 14:29:10,821 INFO L226 Difference]: Without dead ends: 21410 [2022-12-14 14:29:10,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:29:10,822 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 547 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:10,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 113 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 14:29:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2022-12-14 14:29:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 10560. [2022-12-14 14:29:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 10556 states have (on average 3.3645320197044337) internal successors, (35516), 10559 states have internal predecessors, (35516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 35516 transitions. [2022-12-14 14:29:11,105 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 35516 transitions. Word has length 30 [2022-12-14 14:29:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:11,105 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 35516 transitions. [2022-12-14 14:29:11,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 35516 transitions. [2022-12-14 14:29:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:11,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:11,114 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-12-14 14:29:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-14 14:29:11,114 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1718166840, now seen corresponding path program 2 times [2022-12-14 14:29:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:11,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038170882] [2022-12-14 14:29:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:11,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:11,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038170882] [2022-12-14 14:29:11,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038170882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:11,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:11,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 14:29:11,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910329189] [2022-12-14 14:29:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:11,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:29:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:11,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:29:11,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:29:11,489 INFO L87 Difference]: Start difference. First operand 10560 states and 35516 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:12,513 INFO L93 Difference]: Finished difference Result 18588 states and 61844 transitions. [2022-12-14 14:29:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:29:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:12,548 INFO L225 Difference]: With dead ends: 18588 [2022-12-14 14:29:12,548 INFO L226 Difference]: Without dead ends: 18588 [2022-12-14 14:29:12,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-12-14 14:29:12,549 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 416 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:12,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 50 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:29:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18588 states. [2022-12-14 14:29:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18588 to 10792. [2022-12-14 14:29:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10792 states, 10788 states have (on average 3.374675565443085) internal successors, (36406), 10791 states have internal predecessors, (36406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10792 states to 10792 states and 36406 transitions. [2022-12-14 14:29:12,781 INFO L78 Accepts]: Start accepts. Automaton has 10792 states and 36406 transitions. Word has length 30 [2022-12-14 14:29:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:12,781 INFO L495 AbstractCegarLoop]: Abstraction has 10792 states and 36406 transitions. [2022-12-14 14:29:12,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 10792 states and 36406 transitions. [2022-12-14 14:29:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 14:29:12,793 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:12,793 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-12-14 14:29:12,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-14 14:29:12,794 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1492170128, now seen corresponding path program 3 times [2022-12-14 14:29:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:12,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465996595] [2022-12-14 14:29:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:13,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:13,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465996595] [2022-12-14 14:29:13,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465996595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:13,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:13,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 14:29:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095700223] [2022-12-14 14:29:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:13,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:29:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:29:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:29:13,134 INFO L87 Difference]: Start difference. First operand 10792 states and 36406 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:14,278 INFO L93 Difference]: Finished difference Result 19249 states and 64648 transitions. [2022-12-14 14:29:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:29:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 14:29:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:14,317 INFO L225 Difference]: With dead ends: 19249 [2022-12-14 14:29:14,317 INFO L226 Difference]: Without dead ends: 19249 [2022-12-14 14:29:14,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2022-12-14 14:29:14,317 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 415 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:14,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 71 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 14:29:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19249 states. [2022-12-14 14:29:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19249 to 9783. [2022-12-14 14:29:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9783 states, 9779 states have (on average 3.3916555885059823) internal successors, (33167), 9782 states have internal predecessors, (33167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 33167 transitions. [2022-12-14 14:29:14,518 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 33167 transitions. Word has length 30 [2022-12-14 14:29:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:14,518 INFO L495 AbstractCegarLoop]: Abstraction has 9783 states and 33167 transitions. [2022-12-14 14:29:14,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 33167 transitions. [2022-12-14 14:29:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:14,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:14,525 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-12-14 14:29:14,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-14 14:29:14,525 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 31683023, now seen corresponding path program 1 times [2022-12-14 14:29:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746155321] [2022-12-14 14:29:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:14,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:14,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746155321] [2022-12-14 14:29:14,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746155321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:14,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:14,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:29:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674063709] [2022-12-14 14:29:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:29:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:29:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:29:14,566 INFO L87 Difference]: Start difference. First operand 9783 states and 33167 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:14,630 INFO L93 Difference]: Finished difference Result 4457 states and 13373 transitions. [2022-12-14 14:29:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:29:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:14,661 INFO L225 Difference]: With dead ends: 4457 [2022-12-14 14:29:14,661 INFO L226 Difference]: Without dead ends: 4457 [2022-12-14 14:29:14,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:29:14,662 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:29:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2022-12-14 14:29:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 3769. [2022-12-14 14:29:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 3765 states have (on average 2.948472775564409) internal successors, (11101), 3768 states have internal predecessors, (11101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 11101 transitions. [2022-12-14 14:29:14,704 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 11101 transitions. Word has length 31 [2022-12-14 14:29:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:14,704 INFO L495 AbstractCegarLoop]: Abstraction has 3769 states and 11101 transitions. [2022-12-14 14:29:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 11101 transitions. [2022-12-14 14:29:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:14,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:14,707 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-12-14 14:29:14,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-14 14:29:14,707 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -903812049, now seen corresponding path program 1 times [2022-12-14 14:29:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:14,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499341729] [2022-12-14 14:29:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:15,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-12-14 14:29:16,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499341729] [2022-12-14 14:29:16,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499341729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:16,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:16,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 14:29:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912418086] [2022-12-14 14:29:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:16,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:29:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:29:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:29:16,001 INFO L87 Difference]: Start difference. First operand 3769 states and 11101 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:18,332 INFO L93 Difference]: Finished difference Result 4422 states and 12885 transitions. [2022-12-14 14:29:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:29:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:18,338 INFO L225 Difference]: With dead ends: 4422 [2022-12-14 14:29:18,338 INFO L226 Difference]: Without dead ends: 4422 [2022-12-14 14:29:18,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:29:18,339 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 290 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:18,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 49 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:29:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2022-12-14 14:29:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4177. [2022-12-14 14:29:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4173 states have (on average 2.945602683920441) internal successors, (12292), 4176 states have internal predecessors, (12292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 12292 transitions. [2022-12-14 14:29:18,388 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 12292 transitions. Word has length 31 [2022-12-14 14:29:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:18,388 INFO L495 AbstractCegarLoop]: Abstraction has 4177 states and 12292 transitions. [2022-12-14 14:29:18,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 12292 transitions. [2022-12-14 14:29:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:18,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:18,390 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-12-14 14:29:18,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-14 14:29:18,390 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1407088147, now seen corresponding path program 2 times [2022-12-14 14:29:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224474420] [2022-12-14 14:29:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:19,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224474420] [2022-12-14 14:29:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224474420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:19,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:19,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 14:29:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380268012] [2022-12-14 14:29:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:19,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:29:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:29:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:29:19,385 INFO L87 Difference]: Start difference. First operand 4177 states and 12292 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:21,521 INFO L93 Difference]: Finished difference Result 4999 states and 14547 transitions. [2022-12-14 14:29:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:29:21,521 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:21,527 INFO L225 Difference]: With dead ends: 4999 [2022-12-14 14:29:21,527 INFO L226 Difference]: Without dead ends: 4999 [2022-12-14 14:29:21,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:29:21,528 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 410 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 80 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:29:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2022-12-14 14:29:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4461. [2022-12-14 14:29:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4461 states, 4457 states have (on average 2.9293246578415975) internal successors, (13056), 4460 states have internal predecessors, (13056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 13056 transitions. [2022-12-14 14:29:21,582 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 13056 transitions. Word has length 31 [2022-12-14 14:29:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:21,582 INFO L495 AbstractCegarLoop]: Abstraction has 4461 states and 13056 transitions. [2022-12-14 14:29:21,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 13056 transitions. [2022-12-14 14:29:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:21,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:21,585 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-12-14 14:29:21,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-14 14:29:21,585 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1585346968, now seen corresponding path program 1 times [2022-12-14 14:29:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:21,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95180958] [2022-12-14 14:29:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:22,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95180958] [2022-12-14 14:29:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95180958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 14:29:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113517522] [2022-12-14 14:29:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:22,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:29:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:29:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:29:22,815 INFO L87 Difference]: Start difference. First operand 4461 states and 13056 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:24,628 INFO L93 Difference]: Finished difference Result 5332 states and 15483 transitions. [2022-12-14 14:29:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:29:24,628 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:24,635 INFO L225 Difference]: With dead ends: 5332 [2022-12-14 14:29:24,635 INFO L226 Difference]: Without dead ends: 5332 [2022-12-14 14:29:24,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:29:24,636 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 324 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:24,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 72 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:29:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2022-12-14 14:29:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 5113. [2022-12-14 14:29:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 5109 states have (on average 2.919945194754355) internal successors, (14918), 5112 states have internal predecessors, (14918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 14918 transitions. [2022-12-14 14:29:24,697 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 14918 transitions. Word has length 31 [2022-12-14 14:29:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:24,698 INFO L495 AbstractCegarLoop]: Abstraction has 5113 states and 14918 transitions. [2022-12-14 14:29:24,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 14918 transitions. [2022-12-14 14:29:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:24,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:24,701 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-12-14 14:29:24,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-14 14:29:24,701 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -899058813, now seen corresponding path program 3 times [2022-12-14 14:29:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:24,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852591621] [2022-12-14 14:29:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:26,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:26,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852591621] [2022-12-14 14:29:26,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852591621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:26,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:26,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-14 14:29:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609380325] [2022-12-14 14:29:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:26,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 14:29:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 14:29:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:29:26,029 INFO L87 Difference]: Start difference. First operand 5113 states and 14918 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:28,440 INFO L93 Difference]: Finished difference Result 5846 states and 16854 transitions. [2022-12-14 14:29:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:29:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:28,452 INFO L225 Difference]: With dead ends: 5846 [2022-12-14 14:29:28,453 INFO L226 Difference]: Without dead ends: 5846 [2022-12-14 14:29:28,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:29:28,453 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 299 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:28,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 54 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:29:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5846 states. [2022-12-14 14:29:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5846 to 5145. [2022-12-14 14:29:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 5141 states have (on average 2.920443493483758) internal successors, (15014), 5144 states have internal predecessors, (15014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 15014 transitions. [2022-12-14 14:29:28,546 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 15014 transitions. Word has length 31 [2022-12-14 14:29:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:28,546 INFO L495 AbstractCegarLoop]: Abstraction has 5145 states and 15014 transitions. [2022-12-14 14:29:28,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 15014 transitions. [2022-12-14 14:29:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:28,550 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:28,550 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-12-14 14:29:28,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-14 14:29:28,551 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1411841383, now seen corresponding path program 4 times [2022-12-14 14:29:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:28,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376326728] [2022-12-14 14:29:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:29,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:29,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376326728] [2022-12-14 14:29:29,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376326728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:29,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:29,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 14:29:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713513845] [2022-12-14 14:29:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:29,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:29:29,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:29,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:29:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:29:29,570 INFO L87 Difference]: Start difference. First operand 5145 states and 15014 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:32,058 INFO L93 Difference]: Finished difference Result 6415 states and 18500 transitions. [2022-12-14 14:29:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:29:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:32,078 INFO L225 Difference]: With dead ends: 6415 [2022-12-14 14:29:32,078 INFO L226 Difference]: Without dead ends: 6415 [2022-12-14 14:29:32,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:29:32,079 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 320 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:32,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 99 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:29:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6415 states. [2022-12-14 14:29:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6415 to 5103. [2022-12-14 14:29:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5103 states, 5099 states have (on average 2.919788193763483) internal successors, (14888), 5102 states have internal predecessors, (14888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 14888 transitions. [2022-12-14 14:29:32,153 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 14888 transitions. Word has length 31 [2022-12-14 14:29:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:32,153 INFO L495 AbstractCegarLoop]: Abstraction has 5103 states and 14888 transitions. [2022-12-14 14:29:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 14888 transitions. [2022-12-14 14:29:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:32,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:32,157 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-12-14 14:29:32,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-14 14:29:32,157 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1164952631, now seen corresponding path program 5 times [2022-12-14 14:29:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:32,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835681860] [2022-12-14 14:29:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:33,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:33,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835681860] [2022-12-14 14:29:33,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835681860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:33,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:33,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 14:29:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459120776] [2022-12-14 14:29:33,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:33,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:29:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:29:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:29:33,267 INFO L87 Difference]: Start difference. First operand 5103 states and 14888 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:36,188 INFO L93 Difference]: Finished difference Result 5627 states and 16289 transitions. [2022-12-14 14:29:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:29:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:36,197 INFO L225 Difference]: With dead ends: 5627 [2022-12-14 14:29:36,197 INFO L226 Difference]: Without dead ends: 5627 [2022-12-14 14:29:36,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:29:36,198 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 319 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:36,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 62 Invalid, 3525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 14:29:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2022-12-14 14:29:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 5100. [2022-12-14 14:29:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5100 states, 5096 states have (on average 2.919740973312402) internal successors, (14879), 5099 states have internal predecessors, (14879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 14879 transitions. [2022-12-14 14:29:36,267 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 14879 transitions. Word has length 31 [2022-12-14 14:29:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:36,267 INFO L495 AbstractCegarLoop]: Abstraction has 5100 states and 14879 transitions. [2022-12-14 14:29:36,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 14879 transitions. [2022-12-14 14:29:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:36,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:36,271 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-12-14 14:29:36,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-14 14:29:36,271 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1145947565, now seen corresponding path program 6 times [2022-12-14 14:29:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:36,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534316171] [2022-12-14 14:29:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:37,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534316171] [2022-12-14 14:29:37,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534316171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:37,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:37,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 14:29:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686291015] [2022-12-14 14:29:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:37,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:29:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:29:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:29:37,284 INFO L87 Difference]: Start difference. First operand 5100 states and 14879 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:39,615 INFO L93 Difference]: Finished difference Result 6640 states and 19225 transitions. [2022-12-14 14:29:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:29:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:39,625 INFO L225 Difference]: With dead ends: 6640 [2022-12-14 14:29:39,625 INFO L226 Difference]: Without dead ends: 6640 [2022-12-14 14:29:39,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:29:39,625 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 378 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 3993 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:39,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 131 Invalid, 4011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3993 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:29:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2022-12-14 14:29:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 5073. [2022-12-14 14:29:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 5069 states have (on average 2.919313474058) internal successors, (14798), 5072 states have internal predecessors, (14798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 14798 transitions. [2022-12-14 14:29:39,693 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 14798 transitions. Word has length 31 [2022-12-14 14:29:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 5073 states and 14798 transitions. [2022-12-14 14:29:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 14798 transitions. [2022-12-14 14:29:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:39,697 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:39,697 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-12-14 14:29:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-14 14:29:39,697 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -285630033, now seen corresponding path program 7 times [2022-12-14 14:29:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935386863] [2022-12-14 14:29:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:40,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:40,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935386863] [2022-12-14 14:29:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935386863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:40,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 14:29:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994807058] [2022-12-14 14:29:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:40,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:29:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:29:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:29:40,690 INFO L87 Difference]: Start difference. First operand 5073 states and 14798 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:43,084 INFO L93 Difference]: Finished difference Result 5746 states and 16670 transitions. [2022-12-14 14:29:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:29:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:43,092 INFO L225 Difference]: With dead ends: 5746 [2022-12-14 14:29:43,092 INFO L226 Difference]: Without dead ends: 5746 [2022-12-14 14:29:43,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:29:43,092 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 324 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:43,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 100 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 14:29:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2022-12-14 14:29:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 5013. [2022-12-14 14:29:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5013 states, 5009 states have (on average 2.924336194849271) internal successors, (14648), 5012 states have internal predecessors, (14648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 14648 transitions. [2022-12-14 14:29:43,152 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 14648 transitions. Word has length 31 [2022-12-14 14:29:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:43,153 INFO L495 AbstractCegarLoop]: Abstraction has 5013 states and 14648 transitions. [2022-12-14 14:29:43,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 14648 transitions. [2022-12-14 14:29:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:43,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:43,156 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-12-14 14:29:43,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-14 14:29:43,156 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1321793401, now seen corresponding path program 8 times [2022-12-14 14:29:43,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:43,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244426390] [2022-12-14 14:29:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:44,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:44,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244426390] [2022-12-14 14:29:44,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244426390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:44,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:44,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 14:29:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115173958] [2022-12-14 14:29:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:44,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:29:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:29:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:29:44,018 INFO L87 Difference]: Start difference. First operand 5013 states and 14648 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:46,161 INFO L93 Difference]: Finished difference Result 5646 states and 16420 transitions. [2022-12-14 14:29:46,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:29:46,162 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:46,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:46,170 INFO L225 Difference]: With dead ends: 5646 [2022-12-14 14:29:46,170 INFO L226 Difference]: Without dead ends: 5646 [2022-12-14 14:29:46,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2022-12-14 14:29:46,170 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 305 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:46,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 102 Invalid, 3542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3527 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 14:29:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2022-12-14 14:29:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 4993. [2022-12-14 14:29:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4989 states have (on average 2.9260372820204448) internal successors, (14598), 4992 states have internal predecessors, (14598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 14598 transitions. [2022-12-14 14:29:46,232 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 14598 transitions. Word has length 31 [2022-12-14 14:29:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:46,232 INFO L495 AbstractCegarLoop]: Abstraction has 4993 states and 14598 transitions. [2022-12-14 14:29:46,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 14598 transitions. [2022-12-14 14:29:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:46,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:46,236 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-12-14 14:29:46,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-14 14:29:46,236 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash -188886879, now seen corresponding path program 9 times [2022-12-14 14:29:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:46,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970733867] [2022-12-14 14:29:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:47,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:47,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970733867] [2022-12-14 14:29:47,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970733867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:47,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:47,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 14:29:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608889120] [2022-12-14 14:29:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:47,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 14:29:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 14:29:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:29:47,076 INFO L87 Difference]: Start difference. First operand 4993 states and 14598 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:49,210 INFO L93 Difference]: Finished difference Result 5485 states and 16005 transitions. [2022-12-14 14:29:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:29:49,210 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:49,218 INFO L225 Difference]: With dead ends: 5485 [2022-12-14 14:29:49,218 INFO L226 Difference]: Without dead ends: 5485 [2022-12-14 14:29:49,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 14:29:49,218 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 336 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:49,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 99 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:29:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2022-12-14 14:29:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 4803. [2022-12-14 14:29:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4799 states have (on average 2.937695353198583) internal successors, (14098), 4802 states have internal predecessors, (14098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 14098 transitions. [2022-12-14 14:29:49,279 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 14098 transitions. Word has length 31 [2022-12-14 14:29:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:49,280 INFO L495 AbstractCegarLoop]: Abstraction has 4803 states and 14098 transitions. [2022-12-14 14:29:49,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 14098 transitions. [2022-12-14 14:29:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:49,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:49,283 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-12-14 14:29:49,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-14 14:29:49,283 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1723562312, now seen corresponding path program 2 times [2022-12-14 14:29:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370909188] [2022-12-14 14:29:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:50,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370909188] [2022-12-14 14:29:50,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370909188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:50,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:50,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 14:29:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129061555] [2022-12-14 14:29:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:50,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 14:29:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 14:29:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-12-14 14:29:50,615 INFO L87 Difference]: Start difference. First operand 4803 states and 14098 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:52,985 INFO L93 Difference]: Finished difference Result 5394 states and 15723 transitions. [2022-12-14 14:29:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:29:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:52,992 INFO L225 Difference]: With dead ends: 5394 [2022-12-14 14:29:52,993 INFO L226 Difference]: Without dead ends: 5394 [2022-12-14 14:29:52,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 14:29:52,993 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 308 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:52,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 65 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 14:29:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2022-12-14 14:29:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 4863. [2022-12-14 14:29:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4859 states have (on average 2.932290594772587) internal successors, (14248), 4862 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 14248 transitions. [2022-12-14 14:29:53,052 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 14248 transitions. Word has length 31 [2022-12-14 14:29:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:53,053 INFO L495 AbstractCegarLoop]: Abstraction has 4863 states and 14248 transitions. [2022-12-14 14:29:53,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 14248 transitions. [2022-12-14 14:29:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:53,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:53,056 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-12-14 14:29:53,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-14 14:29:53,056 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1787672544, now seen corresponding path program 3 times [2022-12-14 14:29:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99114384] [2022-12-14 14:29:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:54,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:54,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99114384] [2022-12-14 14:29:54,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99114384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:54,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:54,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 14:29:54,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582476563] [2022-12-14 14:29:54,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:54,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:29:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:29:54,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:29:54,011 INFO L87 Difference]: Start difference. First operand 4863 states and 14248 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:56,397 INFO L93 Difference]: Finished difference Result 6089 states and 17746 transitions. [2022-12-14 14:29:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:29:56,397 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:56,405 INFO L225 Difference]: With dead ends: 6089 [2022-12-14 14:29:56,405 INFO L226 Difference]: Without dead ends: 6089 [2022-12-14 14:29:56,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:29:56,405 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 281 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3553 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:56,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 95 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3553 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:29:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2022-12-14 14:29:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 4783. [2022-12-14 14:29:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4779 states have (on average 2.937434609750994) internal successors, (14038), 4782 states have internal predecessors, (14038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 14038 transitions. [2022-12-14 14:29:56,464 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 14038 transitions. Word has length 31 [2022-12-14 14:29:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:56,465 INFO L495 AbstractCegarLoop]: Abstraction has 4783 states and 14038 transitions. [2022-12-14 14:29:56,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 14038 transitions. [2022-12-14 14:29:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:56,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:56,468 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-12-14 14:29:56,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-14 14:29:56,468 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash 987368464, now seen corresponding path program 4 times [2022-12-14 14:29:56,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:56,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682793692] [2022-12-14 14:29:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:29:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:29:57,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:29:57,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682793692] [2022-12-14 14:29:57,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682793692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:29:57,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:29:57,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 14:29:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420003940] [2022-12-14 14:29:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:29:57,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:29:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:29:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:29:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:29:57,611 INFO L87 Difference]: Start difference. First operand 4783 states and 14038 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:29:59,538 INFO L93 Difference]: Finished difference Result 5554 states and 16225 transitions. [2022-12-14 14:29:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:29:59,539 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:29:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:29:59,547 INFO L225 Difference]: With dead ends: 5554 [2022-12-14 14:29:59,547 INFO L226 Difference]: Without dead ends: 5554 [2022-12-14 14:29:59,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:29:59,547 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 319 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 3118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:29:59,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 90 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3118 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 14:29:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2022-12-14 14:29:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 4723. [2022-12-14 14:29:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4723 states, 4719 states have (on average 2.9429963975418523) internal successors, (13888), 4722 states have internal predecessors, (13888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 13888 transitions. [2022-12-14 14:29:59,608 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 13888 transitions. Word has length 31 [2022-12-14 14:29:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:29:59,609 INFO L495 AbstractCegarLoop]: Abstraction has 4723 states and 13888 transitions. [2022-12-14 14:29:59,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:29:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 13888 transitions. [2022-12-14 14:29:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:29:59,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:29:59,612 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-12-14 14:29:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-14 14:29:59,612 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:29:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:29:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1846183410, now seen corresponding path program 5 times [2022-12-14 14:29:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:29:59,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064617714] [2022-12-14 14:29:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:29:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:29:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:00,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064617714] [2022-12-14 14:30:00,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064617714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:30:00,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:30:00,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 14:30:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522202760] [2022-12-14 14:30:00,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:30:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:30:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:30:00,498 INFO L87 Difference]: Start difference. First operand 4723 states and 13888 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:02,182 INFO L93 Difference]: Finished difference Result 5454 states and 15975 transitions. [2022-12-14 14:30:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:30:02,183 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:30:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:02,190 INFO L225 Difference]: With dead ends: 5454 [2022-12-14 14:30:02,190 INFO L226 Difference]: Without dead ends: 5454 [2022-12-14 14:30:02,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-12-14 14:30:02,191 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 309 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:02,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 85 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 14:30:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2022-12-14 14:30:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4703. [2022-12-14 14:30:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 4699 states have (on average 2.9448818897637796) internal successors, (13838), 4702 states have internal predecessors, (13838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 13838 transitions. [2022-12-14 14:30:02,248 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 13838 transitions. Word has length 31 [2022-12-14 14:30:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:02,248 INFO L495 AbstractCegarLoop]: Abstraction has 4703 states and 13838 transitions. [2022-12-14 14:30:02,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 13838 transitions. [2022-12-14 14:30:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 14:30:02,251 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:02,251 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-12-14 14:30:02,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-14 14:30:02,251 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1233943954, now seen corresponding path program 6 times [2022-12-14 14:30:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:02,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562065285] [2022-12-14 14:30:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:03,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:03,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562065285] [2022-12-14 14:30:03,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562065285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:30:03,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:30:03,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 14:30:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726835806] [2022-12-14 14:30:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:30:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:03,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:30:03,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:30:03,109 INFO L87 Difference]: Start difference. First operand 4703 states and 13838 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:05,539 INFO L93 Difference]: Finished difference Result 5351 states and 15685 transitions. [2022-12-14 14:30:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:30:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 14:30:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:05,547 INFO L225 Difference]: With dead ends: 5351 [2022-12-14 14:30:05,547 INFO L226 Difference]: Without dead ends: 5351 [2022-12-14 14:30:05,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2022-12-14 14:30:05,547 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 310 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3496 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:05,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 93 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3496 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 14:30:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5351 states. [2022-12-14 14:30:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5351 to 4457. [2022-12-14 14:30:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 4453 states have (on average 2.9501459690096565) internal successors, (13137), 4456 states have internal predecessors, (13137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 13137 transitions. [2022-12-14 14:30:05,606 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 13137 transitions. Word has length 31 [2022-12-14 14:30:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:05,606 INFO L495 AbstractCegarLoop]: Abstraction has 4457 states and 13137 transitions. [2022-12-14 14:30:05,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 13137 transitions. [2022-12-14 14:30:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:30:05,609 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:05,609 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] [2022-12-14 14:30:05,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-14 14:30:05,609 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2046601375, now seen corresponding path program 1 times [2022-12-14 14:30:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092204164] [2022-12-14 14:30:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:06,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092204164] [2022-12-14 14:30:06,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092204164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:06,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079030393] [2022-12-14 14:30:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:06,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:06,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:30:06,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:30:06,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:30:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:06,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 14:30:06,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:30:06,261 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-14 14:30:06,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 14:30:06,316 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 14:30:06,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:30:06,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:06,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:06,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:06,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:06,583 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:30:06,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:30:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:06,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:30:06,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:30:15,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:30:15,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 365 [2022-12-14 14:30:15,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:15,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2022-12-14 14:30:15,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:15,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 273 [2022-12-14 14:30:15,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:15,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 232 [2022-12-14 14:30:15,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:15,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 214 [2022-12-14 14:30:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079030393] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:15,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:30:15,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 38 [2022-12-14 14:30:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434438318] [2022-12-14 14:30:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 14:30:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 14:30:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1224, Unknown=53, NotChecked=146, Total=1560 [2022-12-14 14:30:15,801 INFO L87 Difference]: Start difference. First operand 4457 states and 13137 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:18,177 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:18,423 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_1928 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:18,445 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:18,462 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_1928 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:19,303 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_1928 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:30:23,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:30:23,858 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_1928 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1926) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:24,100 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_1928 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:30:24,595 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_1928 Int) (v_ArrVal_1927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_1927) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1928) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:24,981 INFO L93 Difference]: Finished difference Result 7927 states and 22712 transitions. [2022-12-14 14:30:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 14:30:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:30:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:24,994 INFO L225 Difference]: With dead ends: 7927 [2022-12-14 14:30:24,994 INFO L226 Difference]: Without dead ends: 7927 [2022-12-14 14:30:24,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=189, Invalid=1549, Unknown=108, NotChecked=910, Total=2756 [2022-12-14 14:30:24,995 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 254 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 20 mSolverCounterUnsat, 208 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 208 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:24,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 58 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 991 Invalid, 208 Unknown, 366 Unchecked, 4.1s Time] [2022-12-14 14:30:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2022-12-14 14:30:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 4684. [2022-12-14 14:30:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 4680 states have (on average 2.942735042735043) internal successors, (13772), 4683 states have internal predecessors, (13772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 13772 transitions. [2022-12-14 14:30:25,070 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 13772 transitions. Word has length 32 [2022-12-14 14:30:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:25,070 INFO L495 AbstractCegarLoop]: Abstraction has 4684 states and 13772 transitions. [2022-12-14 14:30:25,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 13772 transitions. [2022-12-14 14:30:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:30:25,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:25,074 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] [2022-12-14 14:30:25,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:30:25,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:25,275 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 670063419, now seen corresponding path program 2 times [2022-12-14 14:30:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709835022] [2022-12-14 14:30:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:26,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709835022] [2022-12-14 14:30:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709835022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366694238] [2022-12-14 14:30:26,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:30:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:26,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:30:26,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:30:26,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:30:26,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:30:26,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:30:26,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 14:30:26,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:30:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:30:26,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:30:26,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:30:26,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:30:26,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:30:26,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:26,785 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:30:26,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 14:30:26,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:30:26,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:30:26,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:30:26,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 14:30:26,939 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 14:30:26,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 14:30:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:27,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:30:27,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366694238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:30:27,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:30:27,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 34 [2022-12-14 14:30:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424500549] [2022-12-14 14:30:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:27,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:30:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:30:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 14:30:27,069 INFO L87 Difference]: Start difference. First operand 4684 states and 13772 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:29,221 INFO L93 Difference]: Finished difference Result 6957 states and 20409 transitions. [2022-12-14 14:30:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:30:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:30:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:29,231 INFO L225 Difference]: With dead ends: 6957 [2022-12-14 14:30:29,231 INFO L226 Difference]: Without dead ends: 6957 [2022-12-14 14:30:29,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=223, Invalid=2129, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 14:30:29,232 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 523 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:29,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 122 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 14:30:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2022-12-14 14:30:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 5575. [2022-12-14 14:30:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 5571 states have (on average 2.9493807215939687) internal successors, (16431), 5574 states have internal predecessors, (16431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 16431 transitions. [2022-12-14 14:30:29,304 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 16431 transitions. Word has length 32 [2022-12-14 14:30:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:29,304 INFO L495 AbstractCegarLoop]: Abstraction has 5575 states and 16431 transitions. [2022-12-14 14:30:29,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 16431 transitions. [2022-12-14 14:30:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:30:29,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:29,307 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] [2022-12-14 14:30:29,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:30:29,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-14 14:30:29,509 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1901119574, now seen corresponding path program 1 times [2022-12-14 14:30:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149239618] [2022-12-14 14:30:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:29,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149239618] [2022-12-14 14:30:29,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149239618] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15589215] [2022-12-14 14:30:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:30:29,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:30:29,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:30:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:30,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 14:30:30,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:30:30,059 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-14 14:30:30,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 14:30:30,084 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:30:30,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:30:30,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:30,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:30,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:30,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:30,369 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:30:30,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:30:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:30,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:30:30,593 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:30:30,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:30:30,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 365 [2022-12-14 14:30:30,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:30,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 322 [2022-12-14 14:30:30,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:30,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 304 [2022-12-14 14:30:30,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:30,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 232 [2022-12-14 14:30:30,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:30,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 219 [2022-12-14 14:30:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:31,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15589215] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:31,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:30:31,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 32 [2022-12-14 14:30:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554320774] [2022-12-14 14:30:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:30:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:30:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=820, Unknown=28, NotChecked=122, Total=1122 [2022-12-14 14:30:31,020 INFO L87 Difference]: Start difference. First operand 5575 states and 16431 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:31,672 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2073 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2077 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:31,762 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2077 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:31,790 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2077 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:32,093 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2073 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:34,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:30:34,728 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (v_ArrVal_2075 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2073 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2073) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2075) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2077 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:36,419 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2077 Int) (v_ArrVal_2076 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2076) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2077 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2077) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:37,744 INFO L93 Difference]: Finished difference Result 14689 states and 42536 transitions. [2022-12-14 14:30:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:30:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:30:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:37,766 INFO L225 Difference]: With dead ends: 14689 [2022-12-14 14:30:37,766 INFO L226 Difference]: Without dead ends: 14689 [2022-12-14 14:30:37,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=212, Invalid=1226, Unknown=76, NotChecked=648, Total=2162 [2022-12-14 14:30:37,766 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 341 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 30 mSolverCounterUnsat, 481 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 481 IncrementalHoareTripleChecker+Unknown, 839 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:37,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 54 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1536 Invalid, 481 Unknown, 839 Unchecked, 5.8s Time] [2022-12-14 14:30:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14689 states. [2022-12-14 14:30:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14689 to 6071. [2022-12-14 14:30:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6071 states, 6067 states have (on average 2.96159551672985) internal successors, (17968), 6070 states have internal predecessors, (17968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 17968 transitions. [2022-12-14 14:30:37,889 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 17968 transitions. Word has length 32 [2022-12-14 14:30:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:37,890 INFO L495 AbstractCegarLoop]: Abstraction has 6071 states and 17968 transitions. [2022-12-14 14:30:37,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 17968 transitions. [2022-12-14 14:30:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:30:37,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:37,894 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] [2022-12-14 14:30:37,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:30:38,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:38,096 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -919749586, now seen corresponding path program 2 times [2022-12-14 14:30:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:38,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864282753] [2022-12-14 14:30:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:38,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:38,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864282753] [2022-12-14 14:30:38,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864282753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:38,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115125428] [2022-12-14 14:30:38,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:30:38,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:30:38,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:30:38,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:30:38,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:30:38,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:30:38,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 14:30:38,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:30:38,641 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-14 14:30:38,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 14:30:38,691 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:30:38,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:30:38,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:38,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:38,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:38,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:39,022 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:30:39,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:30:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:39,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:30:39,218 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:30:39,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1487 treesize of output 1469 [2022-12-14 14:30:39,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:39,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1413 treesize of output 1395 [2022-12-14 14:30:39,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:39,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1166 treesize of output 1102 [2022-12-14 14:30:39,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:39,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 1030 [2022-12-14 14:30:39,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:39,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 918 treesize of output 886 [2022-12-14 14:30:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:39,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115125428] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:39,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:30:39,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 34 [2022-12-14 14:30:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315666690] [2022-12-14 14:30:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:39,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:30:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:30:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=977, Unknown=48, NotChecked=66, Total=1260 [2022-12-14 14:30:39,971 INFO L87 Difference]: Start difference. First operand 6071 states and 17968 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:42,331 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:42,773 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:30:43,009 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:45,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:30:45,171 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:46,409 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:46,460 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:47,129 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:47,803 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:48,202 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:49,321 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:49,544 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:50,160 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2150 Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2150 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2150) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:30:50,270 INFO L93 Difference]: Finished difference Result 12402 states and 35665 transitions. [2022-12-14 14:30:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 14:30:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:30:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:30:50,291 INFO L225 Difference]: With dead ends: 12402 [2022-12-14 14:30:50,291 INFO L226 Difference]: Without dead ends: 12402 [2022-12-14 14:30:50,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=279, Invalid=1548, Unknown=205, NotChecked=1274, Total=3306 [2022-12-14 14:30:50,292 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 356 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 35 mSolverCounterUnsat, 589 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 589 IncrementalHoareTripleChecker+Unknown, 862 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:30:50,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 68 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1335 Invalid, 589 Unknown, 862 Unchecked, 6.1s Time] [2022-12-14 14:30:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12402 states. [2022-12-14 14:30:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12402 to 8489. [2022-12-14 14:30:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8489 states, 8485 states have (on average 2.961461402474956) internal successors, (25128), 8488 states have internal predecessors, (25128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8489 states to 8489 states and 25128 transitions. [2022-12-14 14:30:50,426 INFO L78 Accepts]: Start accepts. Automaton has 8489 states and 25128 transitions. Word has length 32 [2022-12-14 14:30:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:30:50,426 INFO L495 AbstractCegarLoop]: Abstraction has 8489 states and 25128 transitions. [2022-12-14 14:30:50,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8489 states and 25128 transitions. [2022-12-14 14:30:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:30:50,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:30:50,432 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] [2022-12-14 14:30:50,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 14:30:50,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-12-14 14:30:50,633 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:30:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:30:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1396820156, now seen corresponding path program 3 times [2022-12-14 14:30:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:30:50,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99041851] [2022-12-14 14:30:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:30:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:30:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:30:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:51,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:30:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99041851] [2022-12-14 14:30:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99041851] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029351612] [2022-12-14 14:30:51,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:30:51,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:30:51,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:30:51,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:30:51,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:30:51,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:30:51,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:30:51,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 14:30:51,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:30:51,333 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-14 14:30:51,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 14:30:51,393 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:30:51,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:30:51,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:51,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:51,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:51,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:30:51,746 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:30:51,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:30:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:51,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:30:52,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1487 treesize of output 1469 [2022-12-14 14:30:52,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:52,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1350 treesize of output 1318 [2022-12-14 14:30:52,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:52,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1094 treesize of output 1030 [2022-12-14 14:30:52,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:52,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 974 treesize of output 958 [2022-12-14 14:30:52,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:30:52,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 909 treesize of output 891 [2022-12-14 14:30:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:30:52,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029351612] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:30:52,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:30:52,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 35 [2022-12-14 14:30:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88068637] [2022-12-14 14:30:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:30:52,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:30:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:30:52,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:30:52,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1156, Unknown=50, NotChecked=0, Total=1332 [2022-12-14 14:30:52,762 INFO L87 Difference]: Start difference. First operand 8489 states and 25128 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:30:55,414 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:55,446 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (v_ArrVal_2220 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:55,735 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:30:56,328 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (v_ArrVal_2220 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:56,592 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:56,647 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:56,672 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (v_ArrVal_2220 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:56,881 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:57,184 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:57,274 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:57,312 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:57,408 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:58,219 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (v_ArrVal_2220 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:58,270 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:58,647 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:59,033 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2224 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:30:59,177 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:30:59,485 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2222) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2223) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2224) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:00,561 INFO L93 Difference]: Finished difference Result 15952 states and 46516 transitions. [2022-12-14 14:31:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 14:31:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:00,587 INFO L225 Difference]: With dead ends: 15952 [2022-12-14 14:31:00,587 INFO L226 Difference]: Without dead ends: 15952 [2022-12-14 14:31:00,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=226, Invalid=1722, Unknown=194, NotChecked=1890, Total=4032 [2022-12-14 14:31:00,587 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 347 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 53 mSolverCounterUnsat, 563 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 563 IncrementalHoareTripleChecker+Unknown, 762 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:00,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 56 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1434 Invalid, 563 Unknown, 762 Unchecked, 3.9s Time] [2022-12-14 14:31:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15952 states. [2022-12-14 14:31:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15952 to 10819. [2022-12-14 14:31:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 10815 states have (on average 3.0057327785483126) internal successors, (32507), 10818 states have internal predecessors, (32507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 32507 transitions. [2022-12-14 14:31:00,759 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 32507 transitions. Word has length 32 [2022-12-14 14:31:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:00,759 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 32507 transitions. [2022-12-14 14:31:00,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 32507 transitions. [2022-12-14 14:31:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:00,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:00,767 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] [2022-12-14 14:31:00,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 14:31:00,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:00,969 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 4002430, now seen corresponding path program 4 times [2022-12-14 14:31:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:00,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981301317] [2022-12-14 14:31:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:01,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981301317] [2022-12-14 14:31:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981301317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124303740] [2022-12-14 14:31:01,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:31:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:01,581 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:01,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:31:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:01,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:31:01,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:01,724 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-12-14 14:31:01,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2022-12-14 14:31:01,783 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:31:01,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:31:01,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:02,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:02,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:02,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:02,135 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:02,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:02,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:02,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:03,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 181 [2022-12-14 14:31:03,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:03,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:31:03,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:03,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:31:03,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:03,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 111 [2022-12-14 14:31:03,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:03,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2022-12-14 14:31:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124303740] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:03,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:03,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 35 [2022-12-14 14:31:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924610302] [2022-12-14 14:31:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:03,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1090, Unknown=47, NotChecked=68, Total=1332 [2022-12-14 14:31:03,114 INFO L87 Difference]: Start difference. First operand 10819 states and 32507 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:03,351 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:03,468 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:04,262 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:04,448 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:04,796 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:04,805 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-12-14 14:31:05,367 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:05,558 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:05,667 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2293 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2293) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:06,663 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:07,250 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2295 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2294 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2294) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2295) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:07,799 INFO L93 Difference]: Finished difference Result 18784 states and 54649 transitions. [2022-12-14 14:31:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 14:31:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:07,830 INFO L225 Difference]: With dead ends: 18784 [2022-12-14 14:31:07,830 INFO L226 Difference]: Without dead ends: 18784 [2022-12-14 14:31:07,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=222, Invalid=1636, Unknown=170, NotChecked=1164, Total=3192 [2022-12-14 14:31:07,831 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 284 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 24 mSolverCounterUnsat, 358 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 358 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:07,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 51 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1031 Invalid, 358 Unknown, 342 Unchecked, 2.8s Time] [2022-12-14 14:31:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18784 states. [2022-12-14 14:31:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18784 to 11889. [2022-12-14 14:31:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11885 states have (on average 2.9826672275978123) internal successors, (35449), 11888 states have internal predecessors, (35449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 35449 transitions. [2022-12-14 14:31:08,030 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 35449 transitions. Word has length 32 [2022-12-14 14:31:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:08,030 INFO L495 AbstractCegarLoop]: Abstraction has 11889 states and 35449 transitions. [2022-12-14 14:31:08,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 35449 transitions. [2022-12-14 14:31:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:08,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:08,039 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] [2022-12-14 14:31:08,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:31:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:08,241 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 619483218, now seen corresponding path program 5 times [2022-12-14 14:31:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:08,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144179934] [2022-12-14 14:31:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:08,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144179934] [2022-12-14 14:31:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144179934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847913119] [2022-12-14 14:31:08,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:31:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:08,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:08,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:31:08,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:31:08,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:08,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-14 14:31:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:08,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:08,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:31:08,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:08,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:31:08,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:31:08,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:31:09,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:09,149 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:31:09,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 14:31:09,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:09,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:31:09,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:31:09,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 14:31:09,253 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 14:31:09,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 14:31:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:09,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:31:09,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847913119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:31:09,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:31:09,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 27 [2022-12-14 14:31:09,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600853723] [2022-12-14 14:31:09,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:09,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 14:31:09,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 14:31:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:31:09,335 INFO L87 Difference]: Start difference. First operand 11889 states and 35449 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:11,123 INFO L93 Difference]: Finished difference Result 14444 states and 42921 transitions. [2022-12-14 14:31:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:31:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:11,148 INFO L225 Difference]: With dead ends: 14444 [2022-12-14 14:31:11,148 INFO L226 Difference]: Without dead ends: 14444 [2022-12-14 14:31:11,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 14:31:11,148 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 471 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:11,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 111 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 14:31:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14444 states. [2022-12-14 14:31:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14444 to 11655. [2022-12-14 14:31:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11655 states, 11651 states have (on average 2.994764397905759) internal successors, (34892), 11654 states have internal predecessors, (34892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11655 states to 11655 states and 34892 transitions. [2022-12-14 14:31:11,322 INFO L78 Accepts]: Start accepts. Automaton has 11655 states and 34892 transitions. Word has length 32 [2022-12-14 14:31:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:11,322 INFO L495 AbstractCegarLoop]: Abstraction has 11655 states and 34892 transitions. [2022-12-14 14:31:11,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 11655 states and 34892 transitions. [2022-12-14 14:31:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:11,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:11,331 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] [2022-12-14 14:31:11,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:31:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-14 14:31:11,532 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2101015605, now seen corresponding path program 3 times [2022-12-14 14:31:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147036555] [2022-12-14 14:31:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:11,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147036555] [2022-12-14 14:31:11,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147036555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786375861] [2022-12-14 14:31:11,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:31:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:11,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:11,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:31:11,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:31:11,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:11,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:11,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:11,990 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:11,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:12,035 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:12,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:12,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:12,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:12,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:12,261 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:12,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:12,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:12,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2442 Int) (v_ArrVal_2440 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2440) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2442) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:12,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2442 Int) (v_ArrVal_2440 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2439) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2440) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2442) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:12,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2442 Int) (v_ArrVal_2440 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2439) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2440) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2442) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:31:12,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:31:12,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:12,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-12-14 14:31:12,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:12,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-12-14 14:31:12,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:12,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-12-14 14:31:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:12,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786375861] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:12,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:12,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:31:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692006574] [2022-12-14 14:31:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:12,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=844, Unknown=18, NotChecked=186, Total=1190 [2022-12-14 14:31:12,738 INFO L87 Difference]: Start difference. First operand 11655 states and 34892 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:18,320 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2442 Int) (v_ArrVal_2440 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2439) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2440) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2442) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:31:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:20,348 INFO L93 Difference]: Finished difference Result 17764 states and 52334 transitions. [2022-12-14 14:31:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:31:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:20,377 INFO L225 Difference]: With dead ends: 17764 [2022-12-14 14:31:20,377 INFO L226 Difference]: Without dead ends: 17764 [2022-12-14 14:31:20,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=207, Invalid=1326, Unknown=43, NotChecked=316, Total=1892 [2022-12-14 14:31:20,377 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 280 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 9 mSolverCounterUnsat, 241 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 241 IncrementalHoareTripleChecker+Unknown, 1454 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:20,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 72 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1344 Invalid, 241 Unknown, 1454 Unchecked, 2.8s Time] [2022-12-14 14:31:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2022-12-14 14:31:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 11988. [2022-12-14 14:31:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11988 states, 11984 states have (on average 3.001084779706275) internal successors, (35965), 11987 states have internal predecessors, (35965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 35965 transitions. [2022-12-14 14:31:20,568 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 35965 transitions. Word has length 32 [2022-12-14 14:31:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:20,568 INFO L495 AbstractCegarLoop]: Abstraction has 11988 states and 35965 transitions. [2022-12-14 14:31:20,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 35965 transitions. [2022-12-14 14:31:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:20,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:20,577 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] [2022-12-14 14:31:20,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 14:31:20,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-14 14:31:20,778 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 817413735, now seen corresponding path program 4 times [2022-12-14 14:31:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:20,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729279015] [2022-12-14 14:31:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:21,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729279015] [2022-12-14 14:31:21,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729279015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588660589] [2022-12-14 14:31:21,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:31:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:21,164 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:21,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:31:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:21,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:21,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:21,315 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:21,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:21,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:21,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:21,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:21,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:21,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:21,588 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:21,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:21,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:24,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:24,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:31:24,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:24,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:31:24,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:24,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:31:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:24,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-12-14 14:31:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588660589] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 31 [2022-12-14 14:31:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542699727] [2022-12-14 14:31:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:24,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:24,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=832, Unknown=22, NotChecked=60, Total=1056 [2022-12-14 14:31:24,299 INFO L87 Difference]: Start difference. First operand 11988 states and 35965 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:24,774 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:31:25,054 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:25,131 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:31:32,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:31:33,158 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:35,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:31:35,748 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:31:36,082 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:36,243 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:38,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:31:40,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:31:40,604 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2512 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2512 Int) (v_ArrVal_2509 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2509) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2510) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2512) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:43,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:31:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:43,617 INFO L93 Difference]: Finished difference Result 15408 states and 45676 transitions. [2022-12-14 14:31:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 14:31:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:43,642 INFO L225 Difference]: With dead ends: 15408 [2022-12-14 14:31:43,642 INFO L226 Difference]: Without dead ends: 15408 [2022-12-14 14:31:43,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=211, Invalid=1209, Unknown=98, NotChecked=738, Total=2256 [2022-12-14 14:31:43,643 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 208 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 23 mSolverCounterUnsat, 378 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 378 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:43,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 85 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1313 Invalid, 378 Unknown, 649 Unchecked, 12.4s Time] [2022-12-14 14:31:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15408 states. [2022-12-14 14:31:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15408 to 12730. [2022-12-14 14:31:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12730 states, 12726 states have (on average 3.000707213578501) internal successors, (38187), 12729 states have internal predecessors, (38187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12730 states to 12730 states and 38187 transitions. [2022-12-14 14:31:43,835 INFO L78 Accepts]: Start accepts. Automaton has 12730 states and 38187 transitions. Word has length 32 [2022-12-14 14:31:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:43,835 INFO L495 AbstractCegarLoop]: Abstraction has 12730 states and 38187 transitions. [2022-12-14 14:31:43,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12730 states and 38187 transitions. [2022-12-14 14:31:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:43,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:43,844 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] [2022-12-14 14:31:43,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 14:31:44,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-14 14:31:44,045 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 138123611, now seen corresponding path program 5 times [2022-12-14 14:31:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784105910] [2022-12-14 14:31:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:45,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784105910] [2022-12-14 14:31:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784105910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293607306] [2022-12-14 14:31:45,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:31:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:45,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:45,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:31:45,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:31:45,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:45,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:45,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:45,530 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:45,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:45,624 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:45,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:45,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:45,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:45,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:45,915 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:45,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:45,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:46,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2581 Int) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:46,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2581 Int) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:31:46,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:31:46,348 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:46,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:31:46,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:46,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:31:46,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:46,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:31:46,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:46,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2022-12-14 14:31:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:46,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293607306] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:46,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:46,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19, 11] total 41 [2022-12-14 14:31:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915965327] [2022-12-14 14:31:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:46,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:46,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1343, Unknown=12, NotChecked=308, Total=1806 [2022-12-14 14:31:46,500 INFO L87 Difference]: Start difference. First operand 12730 states and 38187 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:46,794 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2581 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:31:47,339 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2581 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:47,515 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2581 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2579) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2580) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2581) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:48,100 INFO L93 Difference]: Finished difference Result 18821 states and 55930 transitions. [2022-12-14 14:31:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:31:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:48,131 INFO L225 Difference]: With dead ends: 18821 [2022-12-14 14:31:48,131 INFO L226 Difference]: Without dead ends: 18821 [2022-12-14 14:31:48,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=187, Invalid=1796, Unknown=25, NotChecked=644, Total=2652 [2022-12-14 14:31:48,132 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 301 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 13 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 945 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:48,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 60 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 819 Invalid, 45 Unknown, 945 Unchecked, 1.1s Time] [2022-12-14 14:31:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18821 states. [2022-12-14 14:31:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18821 to 13120. [2022-12-14 14:31:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13120 states, 13116 states have (on average 3.004879536444038) internal successors, (39412), 13119 states have internal predecessors, (39412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13120 states to 13120 states and 39412 transitions. [2022-12-14 14:31:48,351 INFO L78 Accepts]: Start accepts. Automaton has 13120 states and 39412 transitions. Word has length 32 [2022-12-14 14:31:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:48,352 INFO L495 AbstractCegarLoop]: Abstraction has 13120 states and 39412 transitions. [2022-12-14 14:31:48,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13120 states and 39412 transitions. [2022-12-14 14:31:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:48,361 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:48,361 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] [2022-12-14 14:31:48,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 14:31:48,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:48,563 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 79038803, now seen corresponding path program 6 times [2022-12-14 14:31:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499784014] [2022-12-14 14:31:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:48,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499784014] [2022-12-14 14:31:48,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499784014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986161951] [2022-12-14 14:31:48,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:31:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:48,923 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:48,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:31:49,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:31:49,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:49,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:49,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:49,090 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:49,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:49,109 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:49,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:49,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:49,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:49,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:49,339 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:49,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:49,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:49,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:49,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:49,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:31:49,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:49,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2022-12-14 14:31:49,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:49,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-12-14 14:31:49,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:49,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-12-14 14:31:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:49,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986161951] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:49,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:49,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 31 [2022-12-14 14:31:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331334832] [2022-12-14 14:31:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:49,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=781, Unknown=18, NotChecked=118, Total=1056 [2022-12-14 14:31:49,877 INFO L87 Difference]: Start difference. First operand 13120 states and 39412 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:49,909 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2652 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:31:49,948 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2652 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:31:50,009 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:50,414 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:31:50,454 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:50,484 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2649) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2652 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:31:50,888 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2652 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:31:51,060 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2650 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2650) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2652) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:31:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:51,789 INFO L93 Difference]: Finished difference Result 23795 states and 70929 transitions. [2022-12-14 14:31:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 14:31:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:51,828 INFO L225 Difference]: With dead ends: 23795 [2022-12-14 14:31:51,828 INFO L226 Difference]: Without dead ends: 23795 [2022-12-14 14:31:51,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1142, Unknown=35, NotChecked=790, Total=2162 [2022-12-14 14:31:51,829 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 285 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 24 mSolverCounterUnsat, 128 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 128 IncrementalHoareTripleChecker+Unknown, 713 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:51,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 126 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1286 Invalid, 128 Unknown, 713 Unchecked, 1.4s Time] [2022-12-14 14:31:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23795 states. [2022-12-14 14:31:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23795 to 13599. [2022-12-14 14:31:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13599 states, 13595 states have (on average 3.0044869437293125) internal successors, (40846), 13598 states have internal predecessors, (40846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13599 states to 13599 states and 40846 transitions. [2022-12-14 14:31:52,078 INFO L78 Accepts]: Start accepts. Automaton has 13599 states and 40846 transitions. Word has length 32 [2022-12-14 14:31:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:52,079 INFO L495 AbstractCegarLoop]: Abstraction has 13599 states and 40846 transitions. [2022-12-14 14:31:52,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13599 states and 40846 transitions. [2022-12-14 14:31:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:52,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:52,089 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] [2022-12-14 14:31:52,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:31:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:52,290 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1112729681, now seen corresponding path program 7 times [2022-12-14 14:31:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062328211] [2022-12-14 14:31:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:52,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062328211] [2022-12-14 14:31:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062328211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645464889] [2022-12-14 14:31:52,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:31:52,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:52,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:52,776 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:52,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:31:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:52,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:52,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:52,964 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:52,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:53,028 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:53,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:53,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:53,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:53,277 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:53,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:53,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:31:53,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:53,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:53,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (v_ArrVal_2719 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2719) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:31:53,712 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (v_ArrVal_2719 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2719) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:31:53,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:31:53,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:53,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:31:53,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:53,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:31:53,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:31:53,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2022-12-14 14:31:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645464889] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:53,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:31:53,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 35 [2022-12-14 14:31:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083946974] [2022-12-14 14:31:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:31:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:31:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:31:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:31:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=948, Unknown=9, NotChecked=260, Total=1332 [2022-12-14 14:31:53,845 INFO L87 Difference]: Start difference. First operand 13599 states and 40846 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:54,467 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (v_ArrVal_2719 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2719) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2722 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2720 (Array Int Int)) (v_ArrVal_2722 Int) (v_ArrVal_2719 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2719) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2720) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2722) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:31:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:31:56,185 INFO L93 Difference]: Finished difference Result 20852 states and 61499 transitions. [2022-12-14 14:31:56,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:31:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:31:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:31:56,220 INFO L225 Difference]: With dead ends: 20852 [2022-12-14 14:31:56,220 INFO L226 Difference]: Without dead ends: 20852 [2022-12-14 14:31:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=1450, Unknown=35, NotChecked=410, Total=2070 [2022-12-14 14:31:56,220 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 360 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 11 mSolverCounterUnsat, 101 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 101 IncrementalHoareTripleChecker+Unknown, 1216 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:31:56,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 51 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 873 Invalid, 101 Unknown, 1216 Unchecked, 1.6s Time] [2022-12-14 14:31:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20852 states. [2022-12-14 14:31:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20852 to 13953. [2022-12-14 14:31:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13953 states, 13949 states have (on average 2.9992114130045167) internal successors, (41836), 13952 states have internal predecessors, (41836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13953 states to 13953 states and 41836 transitions. [2022-12-14 14:31:56,488 INFO L78 Accepts]: Start accepts. Automaton has 13953 states and 41836 transitions. Word has length 32 [2022-12-14 14:31:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:31:56,488 INFO L495 AbstractCegarLoop]: Abstraction has 13953 states and 41836 transitions. [2022-12-14 14:31:56,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:31:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 13953 states and 41836 transitions. [2022-12-14 14:31:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:31:56,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:31:56,498 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] [2022-12-14 14:31:56,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 14:31:56,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-12-14 14:31:56,700 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:31:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:31:56,701 INFO L85 PathProgramCache]: Analyzing trace with hash -824848017, now seen corresponding path program 8 times [2022-12-14 14:31:56,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:31:56,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098508314] [2022-12-14 14:31:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:31:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:31:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:31:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:57,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:31:57,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098508314] [2022-12-14 14:31:57,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098508314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:31:57,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6411571] [2022-12-14 14:31:57,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:31:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:31:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:31:57,029 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:31:57,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 14:31:57,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:31:57,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:31:57,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:31:57,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:31:57,225 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:31:57,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:31:57,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:31:57,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:31:57,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:57,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:57,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:31:57,487 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:31:57,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:31:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:31:57,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:02,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:32:02,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:02,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2022-12-14 14:32:02,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:02,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 125 [2022-12-14 14:32:02,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:02,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-12-14 14:32:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:02,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6411571] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:02,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:32:02,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:32:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094071145] [2022-12-14 14:32:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:02,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:32:02,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:32:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=995, Unknown=42, NotChecked=0, Total=1190 [2022-12-14 14:32:02,465 INFO L87 Difference]: Start difference. First operand 13953 states and 41836 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:03,367 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:32:05,600 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:05,609 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:09,971 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:12,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:12,509 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:32:12,598 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:32:12,625 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:12,669 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:12,851 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2791 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:32:13,017 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:15,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:16,127 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2789) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:16,487 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2791 Int) (v_ArrVal_2790 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2790) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2791) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:18,520 INFO L93 Difference]: Finished difference Result 21175 states and 62383 transitions. [2022-12-14 14:32:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 14:32:18,521 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:32:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:18,554 INFO L225 Difference]: With dead ends: 21175 [2022-12-14 14:32:18,554 INFO L226 Difference]: Without dead ends: 21175 [2022-12-14 14:32:18,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=282, Invalid=1783, Unknown=145, NotChecked=1212, Total=3422 [2022-12-14 14:32:18,555 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 352 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 40 mSolverCounterUnsat, 573 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 573 IncrementalHoareTripleChecker+Unknown, 694 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:18,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 125 Invalid, 3340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2033 Invalid, 573 Unknown, 694 Unchecked, 8.4s Time] [2022-12-14 14:32:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21175 states. [2022-12-14 14:32:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21175 to 16044. [2022-12-14 14:32:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16044 states, 16040 states have (on average 2.992643391521197) internal successors, (48002), 16043 states have internal predecessors, (48002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16044 states to 16044 states and 48002 transitions. [2022-12-14 14:32:18,853 INFO L78 Accepts]: Start accepts. Automaton has 16044 states and 48002 transitions. Word has length 32 [2022-12-14 14:32:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:18,853 INFO L495 AbstractCegarLoop]: Abstraction has 16044 states and 48002 transitions. [2022-12-14 14:32:18,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 16044 states and 48002 transitions. [2022-12-14 14:32:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:32:18,865 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:18,865 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] [2022-12-14 14:32:18,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 14:32:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:19,067 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:32:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1034030211, now seen corresponding path program 9 times [2022-12-14 14:32:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827848517] [2022-12-14 14:32:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:19,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827848517] [2022-12-14 14:32:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827848517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689560120] [2022-12-14 14:32:19,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:32:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:19,385 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:19,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 14:32:19,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:32:19,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:32:19,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:32:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:19,548 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:32:19,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:32:19,568 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:32:19,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:32:19,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:19,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:19,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:19,795 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:32:19,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:32:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:19,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:20,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2862 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2860) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:24,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2862 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2859) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2860) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:32:24,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:32:24,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:24,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:32:24,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:24,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-12-14 14:32:24,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:24,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:32:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689560120] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:24,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:32:24,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 31 [2022-12-14 14:32:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106427682] [2022-12-14 14:32:24,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:24,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:32:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:32:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=767, Unknown=39, NotChecked=118, Total=1056 [2022-12-14 14:32:24,399 INFO L87 Difference]: Start difference. First operand 16044 states and 48002 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:24,641 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2862 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2862 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2859) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2860) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:32:24,789 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2860 (Array Int Int)) (v_ArrVal_2862 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2859) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2860) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2862 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2862) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:32:27,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:29,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:31,699 INFO L93 Difference]: Finished difference Result 24266 states and 71265 transitions. [2022-12-14 14:32:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:32:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:32:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:31,738 INFO L225 Difference]: With dead ends: 24266 [2022-12-14 14:32:31,738 INFO L226 Difference]: Without dead ends: 24266 [2022-12-14 14:32:31,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=188, Invalid=1252, Unknown=58, NotChecked=308, Total=1806 [2022-12-14 14:32:31,739 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 379 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 26 mSolverCounterUnsat, 296 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 296 IncrementalHoareTripleChecker+Unknown, 1462 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:31,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 75 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1330 Invalid, 296 Unknown, 1462 Unchecked, 6.6s Time] [2022-12-14 14:32:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24266 states. [2022-12-14 14:32:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24266 to 16999. [2022-12-14 14:32:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16999 states, 16995 states have (on average 2.975992939099735) internal successors, (50577), 16998 states have internal predecessors, (50577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16999 states to 16999 states and 50577 transitions. [2022-12-14 14:32:32,021 INFO L78 Accepts]: Start accepts. Automaton has 16999 states and 50577 transitions. Word has length 32 [2022-12-14 14:32:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:32,021 INFO L495 AbstractCegarLoop]: Abstraction has 16999 states and 50577 transitions. [2022-12-14 14:32:32,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16999 states and 50577 transitions. [2022-12-14 14:32:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:32:32,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:32,036 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] [2022-12-14 14:32:32,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 14:32:32,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:32,238 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:32:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -903547487, now seen corresponding path program 10 times [2022-12-14 14:32:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:32,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091250654] [2022-12-14 14:32:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:32,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091250654] [2022-12-14 14:32:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091250654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016142734] [2022-12-14 14:32:32,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:32:32,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:32,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:32,581 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:32,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 14:32:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:32,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:32:32,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:32,774 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:32:32,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:32:32,835 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:32:32,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:32:32,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:32,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:33,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:33,041 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:32:33,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:32:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:33,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:33,173 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:33,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:35,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:32:35,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:35,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:32:35,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:35,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-12-14 14:32:35,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:35,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:32:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:35,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016142734] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:35,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:32:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:32:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367832409] [2022-12-14 14:32:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:35,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:32:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:35,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:32:35,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=889, Unknown=32, NotChecked=126, Total=1190 [2022-12-14 14:32:35,605 INFO L87 Difference]: Start difference. First operand 16999 states and 50577 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:36,026 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2932 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:32:36,234 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2932 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:37,116 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2932 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2930 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2932 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2930) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2932) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-12-14 14:32:39,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:40,591 INFO L93 Difference]: Finished difference Result 27978 states and 82220 transitions. [2022-12-14 14:32:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:32:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:32:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:40,642 INFO L225 Difference]: With dead ends: 27978 [2022-12-14 14:32:40,642 INFO L226 Difference]: Without dead ends: 27978 [2022-12-14 14:32:40,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=193, Invalid=1267, Unknown=42, NotChecked=390, Total=1892 [2022-12-14 14:32:40,643 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 320 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 13 mSolverCounterUnsat, 239 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 239 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:40,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 74 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1375 Invalid, 239 Unknown, 480 Unchecked, 4.5s Time] [2022-12-14 14:32:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27978 states. [2022-12-14 14:32:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27978 to 18728. [2022-12-14 14:32:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18728 states, 18724 states have (on average 2.9613864558854948) internal successors, (55449), 18727 states have internal predecessors, (55449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18728 states to 18728 states and 55449 transitions. [2022-12-14 14:32:40,956 INFO L78 Accepts]: Start accepts. Automaton has 18728 states and 55449 transitions. Word has length 32 [2022-12-14 14:32:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:40,956 INFO L495 AbstractCegarLoop]: Abstraction has 18728 states and 55449 transitions. [2022-12-14 14:32:40,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18728 states and 55449 transitions. [2022-12-14 14:32:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:32:40,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:40,972 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] [2022-12-14 14:32:40,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 14:32:41,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:41,173 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:32:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -105650283, now seen corresponding path program 11 times [2022-12-14 14:32:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:41,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728251180] [2022-12-14 14:32:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:32:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:41,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:32:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728251180] [2022-12-14 14:32:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728251180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290426158] [2022-12-14 14:32:41,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:32:41,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:32:41,500 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:32:41,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 14:32:41,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:32:41,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:32:41,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 14:32:41,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:32:41,698 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:32:41,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:32:41,741 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:32:41,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:32:41,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:41,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:41,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:32:41,966 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:32:41,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:32:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:42,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:32:42,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:42,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:50,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2999) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:50,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2999) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:32:50,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:32:50,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:50,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:32:50,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:50,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:32:50,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:32:50,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-12-14 14:32:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:32:50,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290426158] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:32:50,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:32:50,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:32:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579541227] [2022-12-14 14:32:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:32:50,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:32:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:32:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:32:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=16, NotChecked=244, Total=1190 [2022-12-14 14:32:50,475 INFO L87 Difference]: Start difference. First operand 18728 states and 55449 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:53,173 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3001 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2999) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:32:53,350 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3001 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2999) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:32:55,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:57,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:32:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:32:58,964 INFO L93 Difference]: Finished difference Result 29790 states and 86774 transitions. [2022-12-14 14:32:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:32:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:32:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:32:59,016 INFO L225 Difference]: With dead ends: 29790 [2022-12-14 14:32:59,016 INFO L226 Difference]: Without dead ends: 29790 [2022-12-14 14:32:59,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=195, Invalid=1210, Unknown=25, NotChecked=462, Total=1892 [2022-12-14 14:32:59,016 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 247 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 11 mSolverCounterUnsat, 128 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 128 IncrementalHoareTripleChecker+Unknown, 1524 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:32:59,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 72 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1105 Invalid, 128 Unknown, 1524 Unchecked, 5.9s Time] [2022-12-14 14:32:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29790 states. [2022-12-14 14:32:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29790 to 20722. [2022-12-14 14:32:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20722 states, 20718 states have (on average 2.9387489139878364) internal successors, (60885), 20721 states have internal predecessors, (60885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20722 states to 20722 states and 60885 transitions. [2022-12-14 14:32:59,431 INFO L78 Accepts]: Start accepts. Automaton has 20722 states and 60885 transitions. Word has length 32 [2022-12-14 14:32:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:32:59,431 INFO L495 AbstractCegarLoop]: Abstraction has 20722 states and 60885 transitions. [2022-12-14 14:32:59,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:32:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20722 states and 60885 transitions. [2022-12-14 14:32:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:32:59,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:32:59,447 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] [2022-12-14 14:32:59,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 14:32:59,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:32:59,648 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:32:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:32:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1770024891, now seen corresponding path program 12 times [2022-12-14 14:32:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:32:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765697326] [2022-12-14 14:32:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:32:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:32:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:00,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:33:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765697326] [2022-12-14 14:33:00,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765697326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041329852] [2022-12-14 14:33:00,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:33:00,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:33:00,019 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:33:00,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 14:33:00,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:33:00,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:33:00,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:33:00,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:33:00,207 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:33:00,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:33:00,228 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:33:00,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:33:00,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:00,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:00,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:00,434 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:33:00,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:33:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:00,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:33:00,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3072 Int) (v_ArrVal_3070 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3070) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3072) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:00,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3072 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3070 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3069) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3070) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3072) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:00,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:33:00,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:00,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-12-14 14:33:00,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:00,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-12-14 14:33:00,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:00,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-12-14 14:33:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041329852] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:00,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:33:00,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 30 [2022-12-14 14:33:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994517421] [2022-12-14 14:33:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:33:00,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:33:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:33:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:33:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=732, Unknown=20, NotChecked=114, Total=992 [2022-12-14 14:33:00,938 INFO L87 Difference]: Start difference. First operand 20722 states and 60885 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:01,883 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3072 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3070 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3069) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3070) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3072) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3072 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3072) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:05,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:07,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:33:08,494 INFO L93 Difference]: Finished difference Result 33005 states and 96426 transitions. [2022-12-14 14:33:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:33:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:33:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:33:08,548 INFO L225 Difference]: With dead ends: 33005 [2022-12-14 14:33:08,548 INFO L226 Difference]: Without dead ends: 33005 [2022-12-14 14:33:08,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=1312, Unknown=56, NotChecked=234, Total=1806 [2022-12-14 14:33:08,549 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 295 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 16 mSolverCounterUnsat, 142 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 142 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:33:08,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 83 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1378 Invalid, 142 Unknown, 418 Unchecked, 6.5s Time] [2022-12-14 14:33:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33005 states. [2022-12-14 14:33:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33005 to 22264. [2022-12-14 14:33:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22264 states, 22260 states have (on average 2.937915543575921) internal successors, (65398), 22263 states have internal predecessors, (65398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22264 states to 22264 states and 65398 transitions. [2022-12-14 14:33:08,995 INFO L78 Accepts]: Start accepts. Automaton has 22264 states and 65398 transitions. Word has length 32 [2022-12-14 14:33:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:33:08,995 INFO L495 AbstractCegarLoop]: Abstraction has 22264 states and 65398 transitions. [2022-12-14 14:33:08,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22264 states and 65398 transitions. [2022-12-14 14:33:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:33:09,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:33:09,013 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] [2022-12-14 14:33:09,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 14:33:09,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-12-14 14:33:09,214 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:33:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:33:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1616718737, now seen corresponding path program 13 times [2022-12-14 14:33:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:33:09,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970154860] [2022-12-14 14:33:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:33:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:33:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:09,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:33:09,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970154860] [2022-12-14 14:33:09,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970154860] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:09,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346428250] [2022-12-14 14:33:09,650 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:33:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:33:09,651 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:33:09,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 14:33:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:09,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:33:09,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:33:09,831 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:33:09,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:33:09,898 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:33:09,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:33:10,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:10,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:10,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:10,125 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:33:10,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:33:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:10,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:33:16,593 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:33:16,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:33:16,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:16,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:33:16,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:16,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-12-14 14:33:16,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:16,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:33:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:16,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346428250] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:16,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:33:16,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 32 [2022-12-14 14:33:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15195196] [2022-12-14 14:33:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:33:16,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:33:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:33:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:33:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=882, Unknown=33, NotChecked=62, Total=1122 [2022-12-14 14:33:16,689 INFO L87 Difference]: Start difference. First operand 22264 states and 65398 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:16,733 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:21,228 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:21,311 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:21,495 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:21,617 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:23,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:24,037 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:33:24,106 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:33:24,306 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:24,781 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:33:25,162 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3139 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3139) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:33:25,460 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3142 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3140 (Array Int Int)) (v_ArrVal_3142 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3140) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3142) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:33:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:33:27,191 INFO L93 Difference]: Finished difference Result 42390 states and 123602 transitions. [2022-12-14 14:33:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 14:33:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:33:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:33:27,275 INFO L225 Difference]: With dead ends: 42390 [2022-12-14 14:33:27,275 INFO L226 Difference]: Without dead ends: 42390 [2022-12-14 14:33:27,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=243, Invalid=1527, Unknown=84, NotChecked=1116, Total=2970 [2022-12-14 14:33:27,276 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 294 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 25 mSolverCounterUnsat, 358 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 358 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:33:27,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 200 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2000 Invalid, 358 Unknown, 518 Unchecked, 5.3s Time] [2022-12-14 14:33:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42390 states. [2022-12-14 14:33:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42390 to 25603. [2022-12-14 14:33:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25603 states, 25599 states have (on average 2.938708543302473) internal successors, (75228), 25602 states have internal predecessors, (75228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25603 states to 25603 states and 75228 transitions. [2022-12-14 14:33:27,769 INFO L78 Accepts]: Start accepts. Automaton has 25603 states and 75228 transitions. Word has length 32 [2022-12-14 14:33:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:33:27,769 INFO L495 AbstractCegarLoop]: Abstraction has 25603 states and 75228 transitions. [2022-12-14 14:33:27,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25603 states and 75228 transitions. [2022-12-14 14:33:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:33:27,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:33:27,792 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] [2022-12-14 14:33:27,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 14:33:27,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-14 14:33:27,994 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:33:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:33:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1828366297, now seen corresponding path program 14 times [2022-12-14 14:33:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:33:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376086133] [2022-12-14 14:33:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:33:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:33:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:28,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:33:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376086133] [2022-12-14 14:33:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376086133] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528034144] [2022-12-14 14:33:28,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:33:28,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:28,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:33:28,311 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:33:28,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 14:33:28,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:33:28,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:33:28,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:33:28,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:33:28,496 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:33:28,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:33:28,549 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:33:28,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:33:28,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:28,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:28,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:33:28,800 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:33:28,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:33:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:28,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:33:28,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:28,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:28,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (v_ArrVal_3209 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3209) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:29,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (v_ArrVal_3209 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3209) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:33:29,065 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (v_ArrVal_3209 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3209) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:33:29,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:33:29,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:29,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:33:29,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:29,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2022-12-14 14:33:29,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:33:29,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:33:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:29,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528034144] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:29,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:33:29,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:33:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150862073] [2022-12-14 14:33:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:33:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:33:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:33:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:33:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=748, Unknown=5, NotChecked=300, Total=1190 [2022-12-14 14:33:29,154 INFO L87 Difference]: Start difference. First operand 25603 states and 75228 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:36,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:36,334 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3210 (Array Int Int)) (v_ArrVal_3211 Int) (v_ArrVal_3209 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3209) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3210) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3211) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:33:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:33:37,329 INFO L93 Difference]: Finished difference Result 32587 states and 95496 transitions. [2022-12-14 14:33:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:33:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:33:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:33:37,393 INFO L225 Difference]: With dead ends: 32587 [2022-12-14 14:33:37,393 INFO L226 Difference]: Without dead ends: 32587 [2022-12-14 14:33:37,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=200, Invalid=1208, Unknown=22, NotChecked=462, Total=1892 [2022-12-14 14:33:37,394 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 264 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 9 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:33:37,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 69 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 786 Invalid, 41 Unknown, 742 Unchecked, 3.3s Time] [2022-12-14 14:33:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32587 states. [2022-12-14 14:33:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32587 to 26120. [2022-12-14 14:33:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26120 states, 26116 states have (on average 2.936705467912391) internal successors, (76695), 26119 states have internal predecessors, (76695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26120 states to 26120 states and 76695 transitions. [2022-12-14 14:33:37,851 INFO L78 Accepts]: Start accepts. Automaton has 26120 states and 76695 transitions. Word has length 32 [2022-12-14 14:33:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:33:37,851 INFO L495 AbstractCegarLoop]: Abstraction has 26120 states and 76695 transitions. [2022-12-14 14:33:37,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26120 states and 76695 transitions. [2022-12-14 14:33:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:33:37,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:33:37,874 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] [2022-12-14 14:33:37,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 14:33:38,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-14 14:33:38,076 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:33:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:33:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -563022881, now seen corresponding path program 15 times [2022-12-14 14:33:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:33:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934000228] [2022-12-14 14:33:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:33:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:33:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:33:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:38,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:33:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934000228] [2022-12-14 14:33:38,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934000228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:33:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969967304] [2022-12-14 14:33:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:33:38,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:33:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:33:38,427 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:33:38,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 14:33:38,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:33:38,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:33:38,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:33:38,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:33:38,612 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:33:38,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:33:38,686 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:33:38,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:33:38,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:33:38,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:33:38,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:33:38,966 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-12-14 14:33:38,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-12-14 14:33:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:39,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:33:39,215 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_398| Int) (v_ArrVal_3282 Int) (v_ArrVal_3280 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3280) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_398|) (- 4)))) (or (< (select (store .cse0 .cse1 v_ArrVal_3282) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (< (+ (select .cse0 .cse1) 1) v_ArrVal_3282)))) is different from false [2022-12-14 14:33:39,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_398| Int) (v_ArrVal_3282 Int) (v_ArrVal_3279 (Array Int Int)) (v_ArrVal_3280 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3279) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3280) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_398|) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3282) (< (select (store .cse0 .cse1 v_ArrVal_3282) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:33:39,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_398| Int) (v_ArrVal_3282 Int) (v_ArrVal_3279 (Array Int Int)) (v_ArrVal_3280 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3279) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3280) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_398|) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3282) (< (select (store .cse0 .cse1 v_ArrVal_3282) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:33:39,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 363 [2022-12-14 14:33:39,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:33:39,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 381 treesize of output 365 [2022-12-14 14:33:39,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:33:39,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 183 [2022-12-14 14:33:39,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:33:39,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 383 treesize of output 349 [2022-12-14 14:33:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:33:39,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969967304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:33:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007753540] [2022-12-14 14:33:39,827 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:33:39,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:33:39,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-12-14 14:33:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385640601] [2022-12-14 14:33:39,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:33:39,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 14:33:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:33:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 14:33:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1124, Unknown=14, NotChecked=210, Total=1482 [2022-12-14 14:33:39,829 INFO L87 Difference]: Start difference. First operand 26120 states and 76695 transitions. Second operand has 39 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:33:45,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:50,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:33:57,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:00,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:03,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:10,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:25,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:28,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:37,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:39,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:42,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:46,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:53,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:34:56,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:01,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:08,964 INFO L93 Difference]: Finished difference Result 57018 states and 168415 transitions. [2022-12-14 14:35:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-12-14 14:35:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:35:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:09,089 INFO L225 Difference]: With dead ends: 57018 [2022-12-14 14:35:09,089 INFO L226 Difference]: Without dead ends: 57018 [2022-12-14 14:35:09,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 42 SyntacticMatches, 23 SemanticMatches, 176 ConstructedPredicates, 3 IntricatePredicates, 6 DeprecatedPredicates, 10950 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=5030, Invalid=25287, Unknown=145, NotChecked=1044, Total=31506 [2022-12-14 14:35:09,090 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2328 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 14954 mSolverCounterSat, 361 mSolverCounterUnsat, 1379 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 20812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 14954 IncrementalHoareTripleChecker+Invalid, 1379 IncrementalHoareTripleChecker+Unknown, 4118 IncrementalHoareTripleChecker+Unchecked, 61.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:09,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 299 Invalid, 20812 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [361 Valid, 14954 Invalid, 1379 Unknown, 4118 Unchecked, 61.9s Time] [2022-12-14 14:35:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57018 states. [2022-12-14 14:35:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57018 to 23944. [2022-12-14 14:35:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23944 states, 23940 states have (on average 3.0448203842940686) internal successors, (72893), 23943 states have internal predecessors, (72893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23944 states to 23944 states and 72893 transitions. [2022-12-14 14:35:09,807 INFO L78 Accepts]: Start accepts. Automaton has 23944 states and 72893 transitions. Word has length 32 [2022-12-14 14:35:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:09,807 INFO L495 AbstractCegarLoop]: Abstraction has 23944 states and 72893 transitions. [2022-12-14 14:35:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.5) internal successors, (95), 38 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 23944 states and 72893 transitions. [2022-12-14 14:35:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:35:09,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:09,828 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] [2022-12-14 14:35:09,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:10,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:10,029 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:35:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1753789371, now seen corresponding path program 16 times [2022-12-14 14:35:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:10,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011683768] [2022-12-14 14:35:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:10,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011683768] [2022-12-14 14:35:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011683768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096276171] [2022-12-14 14:35:10,373 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:10,374 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:10,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 14:35:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:10,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:35:10,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:10,539 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:35:10,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:35:10,609 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:35:10,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:35:10,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:10,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:10,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:10,831 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:35:10,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:35:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:10,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:10,993 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:35:15,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3349 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3349) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:35:15,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:35:15,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:15,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2022-12-14 14:35:15,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:15,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-12-14 14:35:15,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:15,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-12-14 14:35:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:15,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096276171] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:15,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:15,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 33 [2022-12-14 14:35:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241686583] [2022-12-14 14:35:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:15,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:35:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:35:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=905, Unknown=22, NotChecked=126, Total=1190 [2022-12-14 14:35:15,358 INFO L87 Difference]: Start difference. First operand 23944 states and 72893 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:15,393 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3352 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:15,427 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3352 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:18,382 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3349 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3349) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:20,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:23,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:25,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:25,143 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3352 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:35:27,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:29,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:36,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:36,171 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:35:36,183 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3352 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3350) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3352) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:37,663 INFO L93 Difference]: Finished difference Result 51232 states and 153864 transitions. [2022-12-14 14:35:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 14:35:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:35:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:37,787 INFO L225 Difference]: With dead ends: 51232 [2022-12-14 14:35:37,787 INFO L226 Difference]: Without dead ends: 51232 [2022-12-14 14:35:37,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=310, Invalid=2172, Unknown=100, NotChecked=840, Total=3422 [2022-12-14 14:35:37,787 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 594 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 19 mSolverCounterUnsat, 143 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 143 IncrementalHoareTripleChecker+Unknown, 522 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:37,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 198 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1548 Invalid, 143 Unknown, 522 Unchecked, 14.7s Time] [2022-12-14 14:35:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51232 states. [2022-12-14 14:35:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51232 to 24578. [2022-12-14 14:35:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24578 states, 24574 states have (on average 3.0431757141694473) internal successors, (74783), 24577 states have internal predecessors, (74783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24578 states to 24578 states and 74783 transitions. [2022-12-14 14:35:38,407 INFO L78 Accepts]: Start accepts. Automaton has 24578 states and 74783 transitions. Word has length 32 [2022-12-14 14:35:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:38,407 INFO L495 AbstractCegarLoop]: Abstraction has 24578 states and 74783 transitions. [2022-12-14 14:35:38,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 24578 states and 74783 transitions. [2022-12-14 14:35:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:35:38,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:38,427 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] [2022-12-14 14:35:38,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 14:35:38,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:38,628 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:35:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1164639969, now seen corresponding path program 17 times [2022-12-14 14:35:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:38,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406274676] [2022-12-14 14:35:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:39,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:39,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406274676] [2022-12-14 14:35:39,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406274676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:39,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441980730] [2022-12-14 14:35:39,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:39,129 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:39,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 14:35:39,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:39,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:39,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:35:39,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:39,343 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:35:39,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:35:39,363 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:35:39,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:35:39,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:39,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:39,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:35:39,569 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:35:39,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:35:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:39,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:39,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:35:48,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:35:48,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:48,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2022-12-14 14:35:48,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:48,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 125 [2022-12-14 14:35:48,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:35:48,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-12-14 14:35:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:48,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441980730] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:48,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:35:48,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 31 [2022-12-14 14:35:48,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611519102] [2022-12-14 14:35:48,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:35:48,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 14:35:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 14:35:48,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=867, Unknown=29, NotChecked=60, Total=1056 [2022-12-14 14:35:48,361 INFO L87 Difference]: Start difference. First operand 24578 states and 74783 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:48,394 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:48,764 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3419 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3419) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:35:53,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:59,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:59,527 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:35:59,591 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3419 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3419) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:35:59,616 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:59,704 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:35:59,762 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3419 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3419) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3419 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3419) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:36:00,900 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3419 (Array Int Int))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3419) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3420 (Array Int Int)) (v_ArrVal_3421 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3420) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3421 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3421) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:36:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:36:02,568 INFO L93 Difference]: Finished difference Result 47608 states and 143130 transitions. [2022-12-14 14:36:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-14 14:36:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:36:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:36:02,666 INFO L225 Difference]: With dead ends: 47608 [2022-12-14 14:36:02,666 INFO L226 Difference]: Without dead ends: 47608 [2022-12-14 14:36:02,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=302, Invalid=2521, Unknown=183, NotChecked=1026, Total=4032 [2022-12-14 14:36:02,667 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 649 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 30 mSolverCounterUnsat, 793 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 793 IncrementalHoareTripleChecker+Unknown, 1708 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:36:02,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 247 Invalid, 4932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2401 Invalid, 793 Unknown, 1708 Unchecked, 9.4s Time] [2022-12-14 14:36:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2022-12-14 14:36:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 26610. [2022-12-14 14:36:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26610 states, 26606 states have (on average 3.040366834548598) internal successors, (80892), 26609 states have internal predecessors, (80892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26610 states to 26610 states and 80892 transitions. [2022-12-14 14:36:03,279 INFO L78 Accepts]: Start accepts. Automaton has 26610 states and 80892 transitions. Word has length 32 [2022-12-14 14:36:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:36:03,279 INFO L495 AbstractCegarLoop]: Abstraction has 26610 states and 80892 transitions. [2022-12-14 14:36:03,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26610 states and 80892 transitions. [2022-12-14 14:36:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:36:03,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:36:03,301 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] [2022-12-14 14:36:03,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 14:36:03,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:03,502 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:36:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:36:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -264592609, now seen corresponding path program 18 times [2022-12-14 14:36:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:36:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829367034] [2022-12-14 14:36:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:36:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:36:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:36:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:03,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:36:03,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829367034] [2022-12-14 14:36:03,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829367034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:36:03,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540721843] [2022-12-14 14:36:03,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:36:03,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:36:03,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:36:03,839 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:36:03,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 14:36:03,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:36:03,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:36:03,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:36:03,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:36:04,005 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:36:04,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:36:04,035 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:36:04,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:36:04,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:36:04,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:36:04,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:36:04,277 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-12-14 14:36:04,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-12-14 14:36:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:04,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:36:04,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_407| Int) (v_ArrVal_3490 (Array Int Int)) (v_ArrVal_3492 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3490) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_407|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3492) (< (select (store .cse0 .cse1 v_ArrVal_3492) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:36:04,648 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3489 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_407| Int) (v_ArrVal_3490 (Array Int Int)) (v_ArrVal_3492 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3489) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3490) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_407|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3492) (< (select (store .cse0 .cse1 v_ArrVal_3492) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:36:04,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 363 [2022-12-14 14:36:04,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:04,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 189 [2022-12-14 14:36:04,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:04,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 357 [2022-12-14 14:36:04,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:36:04,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 383 treesize of output 349 [2022-12-14 14:36:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:36:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540721843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:36:05,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057298293] [2022-12-14 14:36:05,171 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:36:05,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:36:05,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2022-12-14 14:36:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224710095] [2022-12-14 14:36:05,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:36:05,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:36:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:36:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=951, Unknown=5, NotChecked=126, Total=1190 [2022-12-14 14:36:05,173 INFO L87 Difference]: Start difference. First operand 26610 states and 80892 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:10,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:25,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:36:50,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:11,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:16,220 INFO L93 Difference]: Finished difference Result 54888 states and 165928 transitions. [2022-12-14 14:37:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-12-14 14:37:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:16,343 INFO L225 Difference]: With dead ends: 54888 [2022-12-14 14:37:16,343 INFO L226 Difference]: Without dead ends: 54888 [2022-12-14 14:37:16,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 45 SyntacticMatches, 28 SemanticMatches, 222 ConstructedPredicates, 2 IntricatePredicates, 6 DeprecatedPredicates, 20400 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=7463, Invalid=41509, Unknown=98, NotChecked=882, Total=49952 [2022-12-14 14:37:16,345 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 2527 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 9523 mSolverCounterSat, 391 mSolverCounterUnsat, 575 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 11815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 9523 IncrementalHoareTripleChecker+Invalid, 575 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:16,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 288 Invalid, 11815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 9523 Invalid, 575 Unknown, 1326 Unchecked, 34.7s Time] [2022-12-14 14:37:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54888 states. [2022-12-14 14:37:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54888 to 31011. [2022-12-14 14:37:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31011 states, 31007 states have (on average 3.0898829296610444) internal successors, (95808), 31010 states have internal predecessors, (95808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31011 states to 31011 states and 95808 transitions. [2022-12-14 14:37:17,152 INFO L78 Accepts]: Start accepts. Automaton has 31011 states and 95808 transitions. Word has length 32 [2022-12-14 14:37:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:17,153 INFO L495 AbstractCegarLoop]: Abstraction has 31011 states and 95808 transitions. [2022-12-14 14:37:17,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 31011 states and 95808 transitions. [2022-12-14 14:37:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:17,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:17,174 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] [2022-12-14 14:37:17,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 14:37:17,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-12-14 14:37:17,375 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1890820298, now seen corresponding path program 6 times [2022-12-14 14:37:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:17,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819870332] [2022-12-14 14:37:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:18,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819870332] [2022-12-14 14:37:18,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819870332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804570201] [2022-12-14 14:37:18,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:18,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:18,568 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:18,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 14:37:18,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:18,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:18,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:18,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:18,790 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:18,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:18,873 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:18,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:18,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:19,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:19,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:19,112 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:19,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:19,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:19,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3560 (Array Int Int)) (v_ArrVal_3562 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3560) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:37:19,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:37:19,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:19,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-12-14 14:37:19,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:19,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-12-14 14:37:19,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:19,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-12-14 14:37:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:19,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804570201] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:19,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:19,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19, 10] total 39 [2022-12-14 14:37:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269045517] [2022-12-14 14:37:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:19,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1393, Unknown=34, NotChecked=76, Total=1640 [2022-12-14 14:37:19,902 INFO L87 Difference]: Start difference. First operand 31011 states and 95808 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:20,586 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3560 (Array Int Int)) (v_ArrVal_3562 Int) (v_ArrVal_3559 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3559) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3560) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3560 (Array Int Int)) (v_ArrVal_3562 Int) (v_ArrVal_3559 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3559) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3560) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3562 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:22,182 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3560 (Array Int Int)) (v_ArrVal_3562 Int) (v_ArrVal_3559 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3559) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3560) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3562 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3562) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:23,686 INFO L93 Difference]: Finished difference Result 42272 states and 129306 transitions. [2022-12-14 14:37:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:37:23,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:23,775 INFO L225 Difference]: With dead ends: 42272 [2022-12-14 14:37:23,775 INFO L226 Difference]: Without dead ends: 42272 [2022-12-14 14:37:23,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=205, Invalid=2095, Unknown=64, NotChecked=288, Total=2652 [2022-12-14 14:37:23,776 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 249 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 11 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:23,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 96 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1781 Invalid, 140 Unknown, 286 Unchecked, 3.0s Time] [2022-12-14 14:37:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42272 states. [2022-12-14 14:37:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42272 to 31639. [2022-12-14 14:37:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31639 states, 31635 states have (on average 3.0879089615931723) internal successors, (97686), 31638 states have internal predecessors, (97686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31639 states to 31639 states and 97686 transitions. [2022-12-14 14:37:24,408 INFO L78 Accepts]: Start accepts. Automaton has 31639 states and 97686 transitions. Word has length 32 [2022-12-14 14:37:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:24,408 INFO L495 AbstractCegarLoop]: Abstraction has 31639 states and 97686 transitions. [2022-12-14 14:37:24,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31639 states and 97686 transitions. [2022-12-14 14:37:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:24,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:24,433 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] [2022-12-14 14:37:24,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 14:37:24,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:24,635 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -416722162, now seen corresponding path program 7 times [2022-12-14 14:37:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858614435] [2022-12-14 14:37:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:25,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858614435] [2022-12-14 14:37:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858614435] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894002723] [2022-12-14 14:37:25,132 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:25,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:25,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:25,133 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:25,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 14:37:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:25,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:25,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:25,302 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:25,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:25,368 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:25,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:25,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:25,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:25,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:25,585 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:25,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:25,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:25,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3631 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3630) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:37:25,783 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3631 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3630) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:25,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3631 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3629) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3630) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:25,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:37:25,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:25,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:37:25,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:25,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2022-12-14 14:37:25,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:25,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:37:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:26,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894002723] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:26,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:26,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 32 [2022-12-14 14:37:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269930036] [2022-12-14 14:37:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:26,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=12, NotChecked=180, Total=1122 [2022-12-14 14:37:26,061 INFO L87 Difference]: Start difference. First operand 31639 states and 97686 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:26,913 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3631 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3629) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3630) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3631 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:27,112 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3631 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3629) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3630) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3631 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3631) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:29,064 INFO L93 Difference]: Finished difference Result 44802 states and 136258 transitions. [2022-12-14 14:37:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:37:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:29,153 INFO L225 Difference]: With dead ends: 44802 [2022-12-14 14:37:29,153 INFO L226 Difference]: Without dead ends: 44802 [2022-12-14 14:37:29,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=1315, Unknown=25, NotChecked=390, Total=1892 [2022-12-14 14:37:29,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 321 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 13 mSolverCounterUnsat, 80 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 80 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:29,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 77 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1248 Invalid, 80 Unknown, 563 Unchecked, 2.0s Time] [2022-12-14 14:37:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44802 states. [2022-12-14 14:37:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44802 to 32819. [2022-12-14 14:37:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32819 states, 32815 states have (on average 3.0812738077098887) internal successors, (101112), 32818 states have internal predecessors, (101112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32819 states to 32819 states and 101112 transitions. [2022-12-14 14:37:29,813 INFO L78 Accepts]: Start accepts. Automaton has 32819 states and 101112 transitions. Word has length 32 [2022-12-14 14:37:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:29,813 INFO L495 AbstractCegarLoop]: Abstraction has 32819 states and 101112 transitions. [2022-12-14 14:37:29,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32819 states and 101112 transitions. [2022-12-14 14:37:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:29,839 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:29,839 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] [2022-12-14 14:37:29,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 14:37:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:30,041 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1122913610, now seen corresponding path program 8 times [2022-12-14 14:37:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505375345] [2022-12-14 14:37:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:30,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505375345] [2022-12-14 14:37:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505375345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858953738] [2022-12-14 14:37:30,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:30,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:30,349 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:30,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 14:37:30,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:37:30,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:30,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:30,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:30,563 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:30,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:30,585 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:30,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:30,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:30,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:30,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:30,790 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:30,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:30,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:31,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3702 Int) (v_ArrVal_3700 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3700) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:31,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:37:31,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:31,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2022-12-14 14:37:31,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-12-14 14:37:31,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:31,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-12-14 14:37:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:31,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858953738] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:31,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:31,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 28 [2022-12-14 14:37:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064682646] [2022-12-14 14:37:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:31,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=680, Unknown=19, NotChecked=54, Total=870 [2022-12-14 14:37:31,381 INFO L87 Difference]: Start difference. First operand 32819 states and 101112 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:31,705 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3702 Int) (v_ArrVal_3699 (Array Int Int)) (v_ArrVal_3700 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3699) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3700) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3702 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:32,113 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3702 Int) (v_ArrVal_3699 (Array Int Int)) (v_ArrVal_3700 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3699) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3700) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3702 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:33,945 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3702 Int) (v_ArrVal_3700 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3700) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3702 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3702) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:35,299 INFO L93 Difference]: Finished difference Result 49530 states and 151156 transitions. [2022-12-14 14:37:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:37:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:35,414 INFO L225 Difference]: With dead ends: 49530 [2022-12-14 14:37:35,414 INFO L226 Difference]: Without dead ends: 49530 [2022-12-14 14:37:35,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1138, Unknown=32, NotChecked=292, Total=1640 [2022-12-14 14:37:35,415 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 232 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 16 mSolverCounterUnsat, 218 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 218 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:35,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 101 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1865 Invalid, 218 Unknown, 564 Unchecked, 3.3s Time] [2022-12-14 14:37:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49530 states. [2022-12-14 14:37:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49530 to 34478. [2022-12-14 14:37:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34478 states, 34474 states have (on average 3.071590183906712) internal successors, (105890), 34477 states have internal predecessors, (105890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34478 states to 34478 states and 105890 transitions. [2022-12-14 14:37:36,168 INFO L78 Accepts]: Start accepts. Automaton has 34478 states and 105890 transitions. Word has length 32 [2022-12-14 14:37:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:36,168 INFO L495 AbstractCegarLoop]: Abstraction has 34478 states and 105890 transitions. [2022-12-14 14:37:36,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34478 states and 105890 transitions. [2022-12-14 14:37:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:36,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:36,194 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] [2022-12-14 14:37:36,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 14:37:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:36,396 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:36,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1753413390, now seen corresponding path program 9 times [2022-12-14 14:37:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:36,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099189033] [2022-12-14 14:37:36,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:36,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:36,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099189033] [2022-12-14 14:37:36,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099189033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:36,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351936713] [2022-12-14 14:37:36,680 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:37:36,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:36,681 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:36,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 14:37:36,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:37:36,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:36,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:36,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:36,911 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:36,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:36,933 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:36,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:37,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:37,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:37,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:37,112 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:37,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:37,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:37,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:37:37,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (v_ArrVal_3769 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3769) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:37,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:37:37,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:37,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:37:37,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:37,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2022-12-14 14:37:37,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:37,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:37:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:37,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351936713] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:37,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:37,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 27 [2022-12-14 14:37:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277968862] [2022-12-14 14:37:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:37,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=583, Unknown=18, NotChecked=102, Total=812 [2022-12-14 14:37:37,572 INFO L87 Difference]: Start difference. First operand 34478 states and 105890 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:37,873 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3772 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (v_ArrVal_3769 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3769) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:41,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:43,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:43,581 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3772 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:43,637 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3772 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3770 (Array Int Int)) (v_ArrVal_3772 Int) (v_ArrVal_3769 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3769) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3770) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3772) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:37:46,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:46,956 INFO L93 Difference]: Finished difference Result 51181 states and 156044 transitions. [2022-12-14 14:37:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:37:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:47,070 INFO L225 Difference]: With dead ends: 51181 [2022-12-14 14:37:47,070 INFO L226 Difference]: Without dead ends: 51181 [2022-12-14 14:37:47,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1018, Unknown=22, NotChecked=350, Total=1560 [2022-12-14 14:37:47,070 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 325 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 21 mSolverCounterUnsat, 197 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 197 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:47,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 87 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1547 Invalid, 197 Unknown, 824 Unchecked, 8.8s Time] [2022-12-14 14:37:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51181 states. [2022-12-14 14:37:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51181 to 35807. [2022-12-14 14:37:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35807 states, 35803 states have (on average 3.0684858810714184) internal successors, (109861), 35806 states have internal predecessors, (109861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 109861 transitions. [2022-12-14 14:37:47,862 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 109861 transitions. Word has length 32 [2022-12-14 14:37:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:47,862 INFO L495 AbstractCegarLoop]: Abstraction has 35807 states and 109861 transitions. [2022-12-14 14:37:47,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 109861 transitions. [2022-12-14 14:37:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:47,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:47,891 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] [2022-12-14 14:37:47,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 14:37:48,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-12-14 14:37:48,093 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 56493046, now seen corresponding path program 10 times [2022-12-14 14:37:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:48,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918208092] [2022-12-14 14:37:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:48,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918208092] [2022-12-14 14:37:48,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918208092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951628920] [2022-12-14 14:37:48,530 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:37:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:48,531 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:48,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 14:37:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:48,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:48,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:48,711 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:48,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:48,774 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:48,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:48,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:48,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:48,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:49,008 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:49,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:49,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:49,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:49,178 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:49,210 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3839 (Array Int Int)) (v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3839) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:49,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:37:49,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:49,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:37:49,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:49,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:37:49,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:49,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2022-12-14 14:37:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951628920] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:49,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:49,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 29 [2022-12-14 14:37:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999342034] [2022-12-14 14:37:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:49,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=12, NotChecked=162, Total=930 [2022-12-14 14:37:49,430 INFO L87 Difference]: Start difference. First operand 35807 states and 109861 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:51,950 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3839 (Array Int Int)) (v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3839) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3841 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3839 (Array Int Int)) (v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3839) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:37:52,768 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3839 (Array Int Int)) (v_ArrVal_3841 Int) (v_ArrVal_3840 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3839) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3840) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3841 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3841) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-12-14 14:37:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:53,869 INFO L93 Difference]: Finished difference Result 48077 states and 146496 transitions. [2022-12-14 14:37:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:37:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:37:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:53,973 INFO L225 Difference]: With dead ends: 48077 [2022-12-14 14:37:53,973 INFO L226 Difference]: Without dead ends: 48077 [2022-12-14 14:37:53,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=178, Invalid=1081, Unknown=21, NotChecked=360, Total=1640 [2022-12-14 14:37:53,973 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 361 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 13 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:53,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 58 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1039 Invalid, 66 Unknown, 750 Unchecked, 1.8s Time] [2022-12-14 14:37:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48077 states. [2022-12-14 14:37:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48077 to 36660. [2022-12-14 14:37:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36660 states, 36656 states have (on average 3.0647097337407248) internal successors, (112340), 36659 states have internal predecessors, (112340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36660 states to 36660 states and 112340 transitions. [2022-12-14 14:37:54,741 INFO L78 Accepts]: Start accepts. Automaton has 36660 states and 112340 transitions. Word has length 32 [2022-12-14 14:37:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:54,741 INFO L495 AbstractCegarLoop]: Abstraction has 36660 states and 112340 transitions. [2022-12-14 14:37:54,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 36660 states and 112340 transitions. [2022-12-14 14:37:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:37:54,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:54,774 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] [2022-12-14 14:37:54,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 14:37:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-12-14 14:37:54,975 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:37:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1370161196, now seen corresponding path program 11 times [2022-12-14 14:37:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:54,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987937344] [2022-12-14 14:37:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:55,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:55,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987937344] [2022-12-14 14:37:55,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987937344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:55,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767068526] [2022-12-14 14:37:55,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:55,619 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:55,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 14:37:55,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:37:55,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:55,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:37:55,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:55,875 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:37:55,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:37:55,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:37:55,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:37:56,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:56,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:56,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:37:56,173 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:37:56,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:37:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:56,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:56,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:37:56,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3912 Int) (v_ArrVal_3909 (Array Int Int)) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3909) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-12-14 14:37:56,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-12-14 14:37:56,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:56,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-12-14 14:37:56,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:56,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-12-14 14:37:56,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:37:56,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-12-14 14:37:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:56,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767068526] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:56,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:37:56,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 32 [2022-12-14 14:37:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074356036] [2022-12-14 14:37:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:37:56,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:37:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:37:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=875, Unknown=21, NotChecked=122, Total=1122 [2022-12-14 14:37:56,800 INFO L87 Difference]: Start difference. First operand 36660 states and 112340 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:56,836 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3912 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:57,079 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3912 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3909 (Array Int Int)) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3909) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3909 (Array Int Int)) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3909) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:58,585 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3912 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:37:58,617 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3912 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3909 (Array Int Int)) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3909) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:37:58,843 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:37:58,859 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3912 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3909 (Array Int Int)) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_3909) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3912 Int) (v_ArrVal_3910 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3910) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3912) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:38:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:00,301 INFO L93 Difference]: Finished difference Result 71910 states and 218974 transitions. [2022-12-14 14:38:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:38:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:38:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:00,471 INFO L225 Difference]: With dead ends: 71910 [2022-12-14 14:38:00,471 INFO L226 Difference]: Without dead ends: 71910 [2022-12-14 14:38:00,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=1505, Unknown=60, NotChecked=696, Total=2450 [2022-12-14 14:38:00,472 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 372 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 13 mSolverCounterUnsat, 207 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 207 IncrementalHoareTripleChecker+Unknown, 1366 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:00,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 160 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1593 Invalid, 207 Unknown, 1366 Unchecked, 2.6s Time] [2022-12-14 14:38:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71910 states. [2022-12-14 14:38:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71910 to 39033. [2022-12-14 14:38:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39033 states, 39029 states have (on average 3.0638499577237437) internal successors, (119579), 39032 states have internal predecessors, (119579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39033 states to 39033 states and 119579 transitions. [2022-12-14 14:38:01,536 INFO L78 Accepts]: Start accepts. Automaton has 39033 states and 119579 transitions. Word has length 32 [2022-12-14 14:38:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:01,536 INFO L495 AbstractCegarLoop]: Abstraction has 39033 states and 119579 transitions. [2022-12-14 14:38:01,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39033 states and 119579 transitions. [2022-12-14 14:38:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:38:01,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:01,584 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] [2022-12-14 14:38:01,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 14:38:01,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-14 14:38:01,785 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:38:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 94887758, now seen corresponding path program 12 times [2022-12-14 14:38:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128935902] [2022-12-14 14:38:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:02,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128935902] [2022-12-14 14:38:02,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128935902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131560662] [2022-12-14 14:38:02,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:02,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:02,163 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:02,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 14:38:02,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:02,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:02,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:38:02,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:02,353 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:38:02,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:38:02,386 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:38:02,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:38:02,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:02,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:02,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:02,599 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:38:02,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:38:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:02,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:02,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:38:03,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:38:03,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:03,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2022-12-14 14:38:03,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:03,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2022-12-14 14:38:03,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:03,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-12-14 14:38:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:03,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131560662] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:03,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:38:03,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 28 [2022-12-14 14:38:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165285355] [2022-12-14 14:38:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:03,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:38:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:38:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=681, Unknown=13, NotChecked=54, Total=870 [2022-12-14 14:38:03,217 INFO L87 Difference]: Start difference. First operand 39033 states and 119579 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:04,794 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (v_ArrVal_3979 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3979) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:38:05,056 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (v_ArrVal_3979 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3979) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:38:05,656 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:38:05,676 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3981 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:38:06,270 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (v_ArrVal_3979 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_3979) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3981 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-12-14 14:38:06,364 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (forall ((v_ArrVal_3980 (Array Int Int)) (v_ArrVal_3981 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3980) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3981) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:38:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:07,615 INFO L93 Difference]: Finished difference Result 64923 states and 197173 transitions. [2022-12-14 14:38:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 14:38:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:38:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:07,764 INFO L225 Difference]: With dead ends: 64923 [2022-12-14 14:38:07,764 INFO L226 Difference]: Without dead ends: 64923 [2022-12-14 14:38:07,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=1431, Unknown=76, NotChecked=602, Total=2352 [2022-12-14 14:38:07,764 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 409 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 20 mSolverCounterUnsat, 352 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 352 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:07,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 107 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1719 Invalid, 352 Unknown, 1059 Unchecked, 3.1s Time] [2022-12-14 14:38:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64923 states. [2022-12-14 14:38:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64923 to 42993. [2022-12-14 14:38:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42993 states, 42989 states have (on average 3.0436158086952476) internal successors, (130842), 42992 states have internal predecessors, (130842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42993 states to 42993 states and 130842 transitions. [2022-12-14 14:38:08,793 INFO L78 Accepts]: Start accepts. Automaton has 42993 states and 130842 transitions. Word has length 32 [2022-12-14 14:38:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:08,793 INFO L495 AbstractCegarLoop]: Abstraction has 42993 states and 130842 transitions. [2022-12-14 14:38:08,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42993 states and 130842 transitions. [2022-12-14 14:38:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:38:08,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:08,844 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] [2022-12-14 14:38:08,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-14 14:38:09,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:09,046 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:38:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash -611857324, now seen corresponding path program 13 times [2022-12-14 14:38:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531938657] [2022-12-14 14:38:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:10,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531938657] [2022-12-14 14:38:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531938657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135567439] [2022-12-14 14:38:10,532 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:38:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:10,533 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:10,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 14:38:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:38:10,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:10,738 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:38:10,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:38:10,814 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:38:10,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:38:10,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:10,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:11,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 14:38:11,101 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 14:38:11,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-12-14 14:38:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:11,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:11,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4052 Int) (v_ArrVal_4050 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_4050) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4052) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:38:11,353 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4052 Int) (v_ArrVal_4050 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4050) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4052) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-12-14 14:38:11,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-12-14 14:38:11,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:11,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2022-12-14 14:38:11,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:11,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2022-12-14 14:38:11,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:11,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 14:38:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:11,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135567439] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:11,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 14:38:11,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20, 10] total 40 [2022-12-14 14:38:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598997483] [2022-12-14 14:38:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:11,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:38:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:38:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1403, Unknown=22, NotChecked=154, Total=1722 [2022-12-14 14:38:11,805 INFO L87 Difference]: Start difference. First operand 42993 states and 130842 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:13,216 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4052 Int) (v_ArrVal_4049 (Array Int Int)) (v_ArrVal_4050 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_4049) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4050) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_4052) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-12-14 14:38:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:15,566 INFO L93 Difference]: Finished difference Result 55287 states and 167209 transitions. [2022-12-14 14:38:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:38:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:38:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:15,691 INFO L225 Difference]: With dead ends: 55287 [2022-12-14 14:38:15,691 INFO L226 Difference]: Without dead ends: 55287 [2022-12-14 14:38:15,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=216, Invalid=2103, Unknown=45, NotChecked=288, Total=2652 [2022-12-14 14:38:15,691 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 374 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 11 mSolverCounterUnsat, 150 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 150 IncrementalHoareTripleChecker+Unknown, 863 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:15,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 72 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1302 Invalid, 150 Unknown, 863 Unchecked, 2.7s Time] [2022-12-14 14:38:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55287 states. [2022-12-14 14:38:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55287 to 44207. [2022-12-14 14:38:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44207 states, 44203 states have (on average 3.0388887632061174) internal successors, (134328), 44206 states have internal predecessors, (134328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44207 states to 44207 states and 134328 transitions. [2022-12-14 14:38:16,563 INFO L78 Accepts]: Start accepts. Automaton has 44207 states and 134328 transitions. Word has length 32 [2022-12-14 14:38:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:16,563 INFO L495 AbstractCegarLoop]: Abstraction has 44207 states and 134328 transitions. [2022-12-14 14:38:16,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44207 states and 134328 transitions. [2022-12-14 14:38:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:38:16,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:16,607 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] [2022-12-14 14:38:16,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 14:38:16,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:16,808 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:38:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash 668436194, now seen corresponding path program 14 times [2022-12-14 14:38:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:16,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522485480] [2022-12-14 14:38:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:17,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:17,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522485480] [2022-12-14 14:38:17,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522485480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:17,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933280813] [2022-12-14 14:38:17,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:38:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:17,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:17,135 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:17,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 14:38:17,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:38:17,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:17,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-14 14:38:17,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:17,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:17,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:38:17,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:38:17,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:38:17,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:38:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:17,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:17,673 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:38:17,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-12-14 14:38:17,744 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 14:38:17,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-12-14 14:38:17,834 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 14:38:17,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 14:38:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:17,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:38:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933280813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:38:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:38:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 27 [2022-12-14 14:38:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362440717] [2022-12-14 14:38:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:38:17,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 14:38:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 14:38:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-12-14 14:38:17,962 INFO L87 Difference]: Start difference. First operand 44207 states and 134328 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:21,472 INFO L93 Difference]: Finished difference Result 48349 states and 146359 transitions. [2022-12-14 14:38:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 14:38:21,473 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:38:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:21,577 INFO L225 Difference]: With dead ends: 48349 [2022-12-14 14:38:21,577 INFO L226 Difference]: Without dead ends: 48349 [2022-12-14 14:38:21,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 14:38:21,578 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 454 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:21,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 162 Invalid, 3872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 14:38:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48349 states. [2022-12-14 14:38:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48349 to 40777. [2022-12-14 14:38:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40777 states, 40773 states have (on average 3.057415446496456) internal successors, (124660), 40776 states have internal predecessors, (124660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 124660 transitions. [2022-12-14 14:38:22,552 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 124660 transitions. Word has length 32 [2022-12-14 14:38:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:22,552 INFO L495 AbstractCegarLoop]: Abstraction has 40777 states and 124660 transitions. [2022-12-14 14:38:22,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 124660 transitions. [2022-12-14 14:38:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 14:38:22,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:22,601 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] [2022-12-14 14:38:22,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 14:38:22,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:22,803 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:38:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash 543655134, now seen corresponding path program 15 times [2022-12-14 14:38:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:22,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93020957] [2022-12-14 14:38:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:23,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93020957] [2022-12-14 14:38:23,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93020957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699817526] [2022-12-14 14:38:23,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:38:23,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:23,189 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:23,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 14:38:23,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:38:23,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:38:23,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 14:38:23,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:23,377 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 14:38:23,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 14:38:23,440 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:38:23,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:38:23,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:38:23,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:38:23,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:38:23,709 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-12-14 14:38:23,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-12-14 14:38:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:23,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:24,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int) (v_ArrVal_4193 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_4193) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4195) (< (select (store .cse0 .cse1 v_ArrVal_4195) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:38:24,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int) (v_ArrVal_4192 (Array Int Int)) (v_ArrVal_4193 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_4192) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4193) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4195) (< (select (store .cse0 .cse1 v_ArrVal_4195) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3)))) is different from false [2022-12-14 14:38:24,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 363 [2022-12-14 14:38:24,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:24,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 391 treesize of output 357 [2022-12-14 14:38:24,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:24,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 183 [2022-12-14 14:38:24,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:38:24,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 353 [2022-12-14 14:38:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:24,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699817526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765845890] [2022-12-14 14:38:24,501 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:24,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:24,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-12-14 14:38:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313444814] [2022-12-14 14:38:24,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:24,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 14:38:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 14:38:24,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1009, Unknown=7, NotChecked=130, Total=1260 [2022-12-14 14:38:24,502 INFO L87 Difference]: Start difference. First operand 40777 states and 124660 transitions. Second operand has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:30,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:33,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:36,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:43,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:50,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:57,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:00,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4))) (and (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 1) (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int) (v_ArrVal_4193 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4193) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (select (store .cse0 .cse1 v_ArrVal_4195) .cse2) 3) (< (+ (select .cse0 .cse1) 1) v_ArrVal_4195)))) (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int)) (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_4195) (< (select (store .cse3 .cse4 v_ArrVal_4195) .cse2) 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 1) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|))) is different from false [2022-12-14 14:39:03,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4))) (and (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 1) (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int) (v_ArrVal_4193 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_4193) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (select (store .cse0 .cse1 v_ArrVal_4195) .cse2) 3) (< (+ (select .cse0 .cse1) 1) v_ArrVal_4195)))) (forall ((v_ArrVal_4195 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_434| Int)) (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_434|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_4195) (< (select (store .cse3 .cse4 v_ArrVal_4195) .cse2) 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 1) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|))) is different from false [2022-12-14 14:39:14,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:17,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:19,361 INFO L93 Difference]: Finished difference Result 80489 states and 245676 transitions. [2022-12-14 14:39:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-12-14 14:39:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 14:39:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:19,555 INFO L225 Difference]: With dead ends: 80489 [2022-12-14 14:39:19,555 INFO L226 Difference]: Without dead ends: 80489 [2022-12-14 14:39:19,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 190 ConstructedPredicates, 4 IntricatePredicates, 5 DeprecatedPredicates, 12477 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=5190, Invalid=29932, Unknown=50, NotChecked=1500, Total=36672 [2022-12-14 14:39:19,557 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2411 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 11226 mSolverCounterSat, 293 mSolverCounterUnsat, 432 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 12837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 11226 IncrementalHoareTripleChecker+Invalid, 432 IncrementalHoareTripleChecker+Unknown, 886 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:19,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 309 Invalid, 12837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 11226 Invalid, 432 Unknown, 886 Unchecked, 35.6s Time] [2022-12-14 14:39:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80489 states. [2022-12-14 14:39:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80489 to 45077. [2022-12-14 14:39:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45077 states, 45073 states have (on average 3.1279923679364585) internal successors, (140988), 45076 states have internal predecessors, (140988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45077 states to 45077 states and 140988 transitions. [2022-12-14 14:39:20,670 INFO L78 Accepts]: Start accepts. Automaton has 45077 states and 140988 transitions. Word has length 32 [2022-12-14 14:39:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:20,670 INFO L495 AbstractCegarLoop]: Abstraction has 45077 states and 140988 transitions. [2022-12-14 14:39:20,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 35 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45077 states and 140988 transitions. [2022-12-14 14:39:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 14:39:20,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:20,709 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] [2022-12-14 14:39:20,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 14:39:20,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:20,911 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-12-14 14:39:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -310003395, now seen corresponding path program 2 times [2022-12-14 14:39:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944662179] [2022-12-14 14:39:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:22,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:22,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944662179] [2022-12-14 14:39:22,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944662179] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:22,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316174210] [2022-12-14 14:39:22,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:39:22,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:22,341 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:22,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bd3c8-2037-46e8-a867-51a8de2e6e65/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 14:39:22,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:39:22,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:22,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 103 conjunts are in the unsatisfiable core [2022-12-14 14:39:22,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:22,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 14:39:22,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 14:39:22,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 14:39:22,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-14 14:39:22,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:22,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:39:22,976 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 14:39:22,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-12-14 14:39:23,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:23,066 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-14 14:39:23,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 43 [2022-12-14 14:39:23,288 INFO L321 Elim1Store]: treesize reduction 61, result has 34.4 percent of original size [2022-12-14 14:39:23,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 52 [2022-12-14 14:39:23,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:39:23,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 40 [2022-12-14 14:39:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:23,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:40,340 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4273))) (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse3) 4) 4) v_ArrVal_4275)) .cse3 v_ArrVal_4277)))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* 4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| .cse1) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))))))) (< v_ArrVal_4279 2) (< v_ArrVal_4275 1))) is different from false [2022-12-14 14:39:40,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4273 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4273))) (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse3) 4) 4) v_ArrVal_4275)) .cse3 v_ArrVal_4277)))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) (+ (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| .cse1) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))))) (< v_ArrVal_4279 2) (< v_ArrVal_4275 1))) is different from false [2022-12-14 14:39:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:40,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316174210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:40,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [227657941] [2022-12-14 14:39:40,647 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:40,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:40,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 44 [2022-12-14 14:39:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480223913] [2022-12-14 14:39:40,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 14:39:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 14:39:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1693, Unknown=22, NotChecked=170, Total=2070 [2022-12-14 14:39:40,648 INFO L87 Difference]: Start difference. First operand 45077 states and 140988 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:46,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:49,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse7 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 2)) (.cse5 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse6 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (and (= |c_writer_fnThread1of1ForFork0_~i~1#1| 0) (= (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1) (select .cse0 4)) (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (<= 4 (* (select .cse0 20) 4)) (forall ((v_ArrVal_4273 (Array Int Int)) (|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (< 0 (let ((.cse1 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4273) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 .cse2) 4) 4) v_ArrVal_4275)))) (select (store (store .cse1 .cse2 v_ArrVal_4277) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4) v_ArrVal_4279) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_4279 2) (< v_ArrVal_4275 1))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (or (< 0 (let ((.cse4 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store .cse5 .cse6 v_ArrVal_4277)))) (select (select (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select .cse4 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_4279 .cse7))) (= (select .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.offset|) 0) (= |c_writer_fnThread1of1ForFork0_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (< 0 (let ((.cse8 (store (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse9 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse9 .cse2) 4) 4) v_ArrVal_4275)) .cse2 v_ArrVal_4277))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| .cse8) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_4279 2) (< v_ArrVal_4275 1))) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (not (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1| v_ArrVal_4275)) (< v_ArrVal_4279 .cse7) (< 0 (let ((.cse10 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store .cse5 (+ (* (select .cse5 .cse6) 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_4275) .cse6 v_ArrVal_4277)))) (select (select (store .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (select .cse10 |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* 4 (select (select .cse10 |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)))))))) (forall ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (or (< 0 (let ((.cse11 (let ((.cse13 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (store (let ((.cse12 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|))) (store .cse12 (+ (* (select .cse12 .cse13) 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_4275)) .cse13 v_ArrVal_4277)))) (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store .cse11 (+ (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_406| 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_4279)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) (+ (* (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| .cse11) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4)))) (< v_ArrVal_4279 2) (< v_ArrVal_4275 1))))) is different from false [2022-12-14 14:39:55,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:40:19,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:40:22,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:27,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:28,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:31,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:33,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:40:37,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:40:38,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:42,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:45,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:50,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:52,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:40:55,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:40:57,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:00,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:01,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:05,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:07,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:09,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:15,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:16,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:19,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:21,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:22,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:41:24,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]